Three-point bounds for energy minimization
From MaRDI portal
Publication:5326480
DOI10.1090/S0894-0347-2012-00737-1zbMATH Open1335.31006arXiv1103.0485MaRDI QIDQ5326480FDOQ5326480
Authors: Henry Cohn, Jeechul Woo 
Publication date: 6 August 2013
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Abstract: Three-point semidefinite programming bounds are one of the most powerful known tools for bounding the size of spherical codes. In this paper, we use them to prove lower bounds for the potential energy of particles interacting via a pair potential function. We show that our bounds are sharp for seven points in RP^2. Specifically, we prove that the seven lines connecting opposite vertices of a cube and of its dual octahedron are universally optimal. (In other words, among all configurations of seven lines through the origin, this one minimizes energy for all potential functions that are completely monotonic functions of squared chordal distance.) This configuration is the only known universal optimum that is not distance regular, and the last remaining universal optimum in RP^2. We also give a new derivation of semidefinite programming bounds and present several surprising conjectures about them.
Full work available at URL: https://arxiv.org/abs/1103.0485
Recommendations
- Minimum energy triangulations for elliptic problems
- Point sets of minimal energy
- scientific article; zbMATH DE number 3955844
- On the minimization of an energy functional
- Optimal bounding cones of vectors in three dimensions
- On Minimum Energy Problems
- Approximation of minimum energy curves
- An existence theory for a minimum energy problem
- Minimizers of energy functionals
- Minimal energy points and sphere packing
Cites Work
- CSDP, A C library for semidefinite programming
- Title not available (Why is that?)
- Positive definite functions on spheres
- Universally optimal distribution of points on spheres
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Positive polynomials and sums of squares
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Title not available (Why is that?)
- Semidefinite Code Bounds Based on Quadruple Distances
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- The Closest Packing of Spherical Caps in n Dimensions
- McLaren's improved snub cube and other new spherical designs in three dimensions
- Improved Delsarte bounds for spherical codes in small dimensions
- Hilbert distances and positive definite functions
- New upper bounds for kissing numbers from semidefinite programming
- TheD4Root System Is Not Universally Optimal
- The minimum of potential energy of a System of point charges
- Experimental study of energy-minimizing point configurations on spheres
- Order and disorder in energy minimization
- Linear programming bounds for codes in grassmannian spaces
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Point configurations that are asymmetric yet balanced
- Designs as maximum codes in polynomial metric spaces
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Equilibrium of Sets of Particles on a Sphere
- A spherical code
Cited In (16)
- On spherical codes with inner products in a prescribed interval
- Highly symmetric POVMs and their informational power
- The optimal packing of eight points in the real projective plane
- Packings in real projective spaces
- Optimizers of three-point energies and nearly orthogonal sets
- Optimal configurations of lines and a statistical application
- Energy bounds for codes in polynomial metric spaces
- Bounds for spherical codes: the Levenshtein framework lifted
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Potential theory with multivariate kernels
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Extremal problems of circle packings on a sphere and irreducible contact graphs
- Universal lower bounds for potential energy of spherical codes
- The Gaussian core model in high dimensions
- Exact Semidefinite Programming Bounds for Packing Problems
- Distributing many points on spheres: minimal energy and designs
Uses Software
This page was built for publication: Three-point bounds for energy minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326480)
