Metraipolis › archive › dc_da1dba8d0166

Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes — arXiv:2611.08203

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08203
License (as archived)
CC0-1.0
Archived
2026-11-06T14:53:06.445Z
SHA-256 of the archived text
7ef98cd67aa536222f57285925872566cb2e3666782b0e82b05f700cbb3c1354
Stable URL of this page
https://metraipolis.com/documento/dc_da1dba8d0166

How to cite

Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes — arXiv:2611.08203 — arXiv (en), https://arxiv.org/abs/2611.08203 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_da1dba8d0166 (Metraipolis archive dc_da1dba8d0166, sha256 7ef98cd67aa536222f57285925872566cb2e3666782b0e82b05f700cbb3c1354)
BibTeX
@misc{dcda1dba8d0166,
  title = {Common zeros of homogeneous polynomials and the weight hierarchy of projective Reed-Muller codes — arXiv:2611.08203},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08203},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_da1dba8d0166; sha256 7ef98cd67aa536222f57285925872566cb2e3666782b0e82b05f700cbb3c1354},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08203. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 and determines 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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Commutative Algebra (math.AC); Algebraic Geometry (math.AG).
Pagina del lavoro: https://arxiv.org/abs/2611.08203 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:46.060Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).