Universal Lower Bounds for Potential Energy of Spherical Codes
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense – they cannot be improved by employing polynomials of the same or lower degrees in the Delsarte-Yudin method. However, improvements are sometimes possible and we provide a necessary and sufficient condition for the existence of such better bounds. All our bounds can be obtained in a unified manner that does not depend on the potential function, provided the potential is given by an absolutely monotone function of the inner product between pairs of points, and this is the reason for us to call them universal. We also establish a criterion for a given code of dimension n and cardinality N not to be LP-universally optimal, e.g. we show that two codes conjectured by Ballinger et al to be universally optimal are not LP-universally optimal.
Minimal energy problems, Spherical potentials, Spherical codes and designs, Levenshtein bounds, Delsarte–Goethals–Seidel bounds, Linear programming
Analysis | Discrete Mathematics and Combinatorics | Harmonic Analysis and Representation | Mathematics
Peter Boyvalenkov, Peter D. Dragnev, Douglas Hardin, Edward Saff, and Maya Stoyanova (2016).
Universal Lower Bounds for Potential Energy of Spherical Codes. Constructive Approximation. 1-31. Springer US.