Three-point bounds for the square antiprism code in the sphere
Three-point bounds for the square antiprism code in the sphere
An eight-point code in is a set of eight points on the unit sphere in . A completely monotonic potential function on is a smooth, nonnegative function whose derivatives alternate in sign. The energy is the sum of applied to the squared Euclidean distances between distinct code points. A square antiprism is a configuration consisting of two squares in parallel planes, offset by a angle, with variable separation.
Square-antiprism conjecture. For every completely monotonic potential function on , some square antiprism minimizes the energy among all eight-point codes in . Furthermore, the three-point bounds are always sharp for whichever code is optimal.
This conjecture concerns a continuous family of candidate optima, making it more difficult than the isolated-code cases. The optimal energy depends intricately on the potential; for example, for the Coulomb potential, the minimum within the antiprism family is described by a root of an irreducible polynomial of degree .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Henry Cohn and Jeechul Woo, “Three-point bounds for energy minimization”, arXiv:1103.0485 (2013).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.