English

Universal minima of discrete potentials for sharp spherical codes

Metric Geometry 2023-09-13 v2 Combinatorics Optimization and Control

Abstract

This article is devoted to the study of discrete potentials on the sphere in Rn\mathbb{R}^n for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical τ\tau-designs previously derived by the authors, where ``universal'' is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to TT-designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations and thus obtain the minima for the icosahedron, dodecahedron, and sharp codes coming from E8E_8 and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials Pj(n)P^{(n)}_j which we call PULB subspaces, particularly those having basis {Pj(n)}j=02k+2{P2k(n)}.\{P_j^{(n)}\}_{j=0}^{2k+2}\setminus \{P_{2k}^{(n)}\}. Furthermore, for potentials with h(τ+1)<0h^{(\tau+1)}<0 we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the 600600-cell when the potential hh satisfies h(i)0h^{(i)}\geq 0, i=1,,15i=1,\dots,15, and h(16)0.h^{(16)}\leq 0.

Keywords

Cite

@article{arxiv.2211.00092,
  title  = {Universal minima of discrete potentials for sharp spherical codes},
  author = {Peter Boyvalenkov and Peter Dragnev and Douglas Hardin and Edward Saff and Maya Stoyanova},
  journal= {arXiv preprint arXiv:2211.00092},
  year   = {2023}
}

Comments

41 pages, 4 figures, 4 tables

R2 v1 2026-06-28T04:53:11.295Z