arXiv · 2611.08203
Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes
Abstract
We determine the maximum number of common zeros in projective space of any set of linearly independent homogeneous polynomials of the same degree, when the degree is smaller than the cardinality of the finite field. This proves the conjecture of Beelen, Datta, and Ghorpade, resolving a longstanding problem on common zeros and determining the complete weight hierarchy of the corresponding projective Reed-Muller codes. The proof uses Green's hyperplane restriction bound, combined with a footprint argument that reduces the problem to the affine case solved by Heijnen and Pellikaan. Wei duality then determines the hierarchy in sufficiently large degrees, recovering the complete hierarchy in every degree for the projective plane. Finally, we prove an upper bound valid in every degree, and conjecture that it is always sharp.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rodrigo San-José. 2026-11-09. Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes. https://searcharxiv.com/abs/2611.08203
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.