Higher-dimensional product expansion conjecture for Reed–Solomon codes
Resolve the higher-dimensional conjecture formulated by Bafna and Vyas concerning product expansion for Reed–Solomon codes evaluated on multiplicative subgroups of coprime orders.
References
Bafna and Vyas studied product expansion for Reed-Solomon codes on multiplicative subgroups of coprime orders, proving a two-factor result and formulating a higher-dimensional conjecture. Our norm-one evaluation sets satisfy different arithmetic constraints, so our result is complementary and does not resolve their conjecture.
Their qLTC theorem assumes that certain Reed-Solomon code tuples have product expansion with a constant independent of their lengths, which is their Conjecture~5.6. In this work, we prove this expansion property for explicit norm-one families, using polynomial hulls and the inner-generation theorem proved in Appendix~\ref{sec:algebra}. In particular, our result (see Theorem~\ref{thm:rs-product-expansion}) covers the parameter family used in their construction, thereby partially resolving their conjecture.