Metraipolis › archive › dc_f82273767fcc

Characteristic drops for high-order vanishing on the hypercube — arXiv:2609.19009

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19009
License (as archived)
CC0-1.0
Archived
2026-10-15T16:13:12.155Z
SHA-256 of the archived text
910fd5c5b4cf16f0cce9430868195f9de3b4639082a4c50400641b17ec44e083
Stable URL of this page
https://metraipolis.com/documento/dc_f82273767fcc

How to cite

Characteristic drops for high-order vanishing on the hypercube — arXiv:2609.19009 — arXiv (en), https://arxiv.org/abs/2609.19009 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f82273767fcc (Metraipolis archive dc_f82273767fcc, sha256 910fd5c5b4cf16f0cce9430868195f9de3b4639082a4c50400641b17ec44e083)
BibTeX
@misc{dcf82273767fcc,
  title = {Characteristic drops for high-order vanishing on the hypercube — arXiv:2609.19009},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19009},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f82273767fcc; sha256 910fd5c5b4cf16f0cce9430868195f9de3b4639082a4c50400641b17ec44e083},
  year = {2026}
}

Archived text

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

Let $F$ be a field, let $0\le \ell\le k-2$, and suppose that $n\ge k-1$. We determine the minimum degree of a polynomial in $F[x_1,\ldots,x_n]$ that vanishes to order at least $k$ at every nonzero vertex of the Boolean cube and to order exactly $\ell$ at the origin. The answer is \[ n+2k-2-\rho_F(k-\ell), \] where $\rho_F(s)$ is the least number of positive integers summing to $s-1$ whose corresponding Catalan numbers are nonzero in $F$. The proof gives an explicit basis of the reduced vanishing space. In this basis the top-degree map is diagonal, with Catalan numbers on the diagonal; a refinement using block coordinates shows that the basis is compatible with polynomial degree. In odd characteristic the degree is either $n+2k-3$ or $n+2k-4$, according as $C_{k-\ell-2}$ is nonzero or zero. In characteristic $2$ it is \[ n+2k-2-s_2(k-\ell-1), \] where $s_2$ denotes binary digit sum. Thus the first characteristic drop, and all later drops, are determined exactly.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.19009 — 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-10-15T15:38:58.264Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).