The D_4 root system is not universally optimal
arXiv:math/0607447 · doi:10.1080/10586458.2007.10129008
Abstract
We prove that the D_4 root system (equivalently, the set of vertices of the regular 24-cell) is not a universally optimal spherical code. We further conjecture that there is no universally optimal spherical code of 24 points in S^3, based on numerical computations suggesting that every 5-design consisting of 24 points in S^3 is in a 3-parameter family (which we describe explicitly, based on a construction due to Sali) of deformations of the D_4 root system.
11 pages, updated to incorporate small changes in published version
Cited by in corpus (9)
- Experimental study of energy-minimizing point configurations on spheres
- High accuracy semidefinite programming bounds for kissing numbers
- Ground states and formal duality relations in the Gaussian core model
- Three-point bounds for energy minimization
- Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
- Counterintuitive ground states in soft-core models
- Universal bounds for spherical codes: the Levenshtein framework lifted
- Designs related through projective and Hopf maps
- Linear Programming Bounds