Metraipolis › archive › dc_69ea169d7781

Levenshtein-type bounds for $(a,b)$-avoiding spherical codes — arXiv:2611.08709

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08709
License (as archived)
CC0-1.0
Archived
2026-11-09T22:43:54.332Z
SHA-256 of the archived text
16f6631d3dea73133b872882592a4c6f2b62c8dc0f449f850ed7921282c8bebb
Stable URL of this page
https://metraipolis.com/documento/dc_69ea169d7781

How to cite

Levenshtein-type bounds for $(a,b)$-avoiding spherical codes — arXiv:2611.08709 — arXiv (en), https://arxiv.org/abs/2611.08709 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69ea169d7781 (Metraipolis archive dc_69ea169d7781, sha256 16f6631d3dea73133b872882592a4c6f2b62c8dc0f449f850ed7921282c8bebb)
BibTeX
@misc{dc69ea169d7781,
  title = {Levenshtein-type bounds for $(a,b)$-avoiding spherical codes — arXiv:2611.08709},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08709},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69ea169d7781; sha256 16f6631d3dea73133b872882592a4c6f2b62c8dc0f449f850ed7921282c8bebb},
  year = {2026}
}

Archived text

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

We develop a Levenshtein-type linear programming framework (for maximal $s$-codes and for minimal energy) for $(a,b)$-avoiding spherical codes, that is, codes whose inner products between distinct points avoid $(a,b)$. We introduce and investigate signed measures that are positive definite up to an appropriate degree and yield stationary auxiliary linear programming polynomials and exact quadrature formulas. We give explicit conditions for positivity of the quadrature weights and sufficient Krein-type conditions for nonnegative Gegenbauer coefficients (positive definiteness of the candidate optimal linear programming polynomials). Under these hypotheses and suitable node-location assumptions, the resulting cardinality bounds are optimal within the corresponding degree restriction and unique under natural nondegeneracy conditions. Under proper conditions on the quadrature nodes, we obtain universal lower energy bounds by utilizing Hermite interpolants as polynomial solutions of the respective linear program. Common test functions characterize optimality in the full polynomial linear programs under mild additional assumptions.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2611.08709 — 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-09T22:36:32.159Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).