Universal minima of discrete potentials for sharp spherical codes
Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff, Maya, Stoyanova

TL;DR
This paper establishes universal lower bounds for discrete potentials on spheres related to sharp codes, extending to various spherical designs and special configurations like the icosahedron, $E_8$, and the Leech lattice, with implications for potential minimization.
Contribution
It introduces universal bounds for potentials on sharp spherical codes and extends these results to T-designs, special configurations, and specific potential functions.
Findings
Sharp codes attain universal lower bounds for polarization.
Universal bounds apply to T-designs and configurations like the icosahedron and Leech lattice.
Certain potential functions lead to minima at code points, confirming optimality of sharp codes.
Abstract
This article is devoted to the study of discrete potentials on the sphere in for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical -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 -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 and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials which we call PULB subspaces, particularly those having basis…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography
