Minimizing Energy – Theoretical Aspects
Shanks Workshop on Linear Programming Bounds for Minimal Energy Problems
Vanderbilt University, Nashville, TN
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in the framework of the standard linear programming approach. Our bounds are universal in the sense of both Levenshtein and Cohn and Kumar; i.e., they are valid for any choice of dimension and code cardinality and that they apply to any absolutely monotone potential.
minimal energy problems, universal configurations, spherical codes, Delsarte linear programming method
Analysis | Discrete Mathematics and Combinatorics | Other Applied Mathematics
Peter Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, and Maya Stoyanova (2015).
Minimizing Energy – Theoretical Aspects. Presented at Shanks Workshop on Linear Programming Bounds for Minimal Energy Problems, Vanderbilt University, Nashville, TN.