Three-point bounds for energy minimization
From MaRDI portal
Publication:5326480
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.
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
- scientific article; zbMATH DE number 3933354 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2117213 (Why is no real title available?)
- scientific article; zbMATH DE number 3108056 (Why is no real title available?)
- A spherical code
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- CSDP, A C library for semidefinite programming
- Designs as maximum codes in polynomial metric spaces
- Equilibrium of Sets of Particles on a Sphere
- Experimental study of energy-minimizing point configurations on spheres
- Hilbert distances and positive definite functions
- Improved Delsarte bounds for spherical codes in small dimensions
- Linear programming bounds for codes in grassmannian spaces
- McLaren's improved snub cube and other new spherical designs in three dimensions
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Order and disorder in energy minimization
- Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
- Point configurations that are asymmetric yet balanced
- Positive definite functions on spheres
- Positive polynomials and sums of squares
- Semidefinite Code Bounds Based on Quadruple Distances
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- The Closest Packing of Spherical Caps in n Dimensions
- The minimum of potential energy of a System of point charges
- TheD4Root System Is Not Universally Optimal
- Universally optimal distribution of points on spheres
Cited in
(16)- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Extremal problems of circle packings on a sphere and irreducible contact graphs
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- The optimal packing of eight points in the real projective plane
- Optimal configurations of lines and a statistical application
- On spherical codes with inner products in a prescribed interval
- Universal lower bounds for potential energy of spherical codes
- Energy bounds for codes in polynomial metric spaces
- The Gaussian core model in high dimensions
- Exact Semidefinite Programming Bounds for Packing Problems
- Potential theory with multivariate kernels
- Optimizers of three-point energies and nearly orthogonal sets
- Highly symmetric POVMs and their informational power
- Distributing many points on spheres: minimal energy and designs
- Bounds for spherical codes: the Levenshtein framework lifted
- Packings in real projective spaces
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)
