Moment methods in energy minimization: New bounds for Riesz minimal energy problems
arXiv:1610.04905 · doi:10.1090/tran/7976
Abstract
We use moment techniques to construct a converging hierarchy of optimization problems to lower bound the ground state energy of interacting particle systems. We approximate (from below) the infinite dimensional optimization problems in this hierarchy by block diagonal semidefinite programs. For this we develop the necessary harmonic analysis for spaces consisting of subsets of another space, and we develop symmetric sum-of-squares techniques. We numerically compute the second step of our hierarchy for Riesz s-energy problems with five particles on the 2-dimensional unit sphere, where the s=1 case is the Thomson problem. This yields new numerically sharp bounds (up to high precision) and suggests the second step of our hierarchy may be sharp throughout a phase transition and may be universally sharp for 5-particles on the unit sphere. This is the first time a 4-point bound has been computed for a problem in discrete geometry.
arXiv comment(v2) 43 pages, revision based on suggestions by referee, published in Trans. Amer. Math. Soc
References in corpus (11)
- Symmetry groups, semidefinite programs, and sums of squares
- The sphere packing problem in dimension 8
- Universally optimal distribution of points on spheres
- New upper bounds for kissing numbers from semidefinite programming
- Exploiting symmetries in SDP-relaxations for polynomial optimization
- Upper bounds for packings of spheres of several radii
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Three-point bounds for energy minimization
- Semidefinite programming, harmonic analysis and coding theory
- Lecture notes: Semidefinite programs and harmonic analysis
- The Triangular Bi-Pyramid Minimizes a Range of Power Law Potentials