TheD4Root System Is Not Universally Optimal

DOI10.1080/10586458.2007.10129008MaRDI QIDQ5449055zbMATH OpenOpenAlexFDO

Authors Henry Cohn, Noam D. Elkies, Abhinav Kumar, J. H. Conway

Publication date 10 March 2008

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0607447, https://projecteuclid.org/euclid.em/1204928532

zbMATH Keywords

24-cell\(D_4\) root systempotential energy minimizationspherical codespherical designuniversally optimal code

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Decoding (94B35)

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.

Recommendations

• Uniqueness of the 120-point spherical 11-design in four dimensions
• A spherical code
• New spherical 4-designs
• Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
• Universally optimal distribution of points on spheres

Cited in

(17)

• Association schemes related to universally optimal configurations, Kerdock codes and extremal Euclidean line-sets
• A survey on spherical designs and algebraic combinatorics on spheres
• Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
• Upper energy bounds for spherical designs of relatively small cardinalities
• Design theory from the viewpoint of algebraic combinatorics
• On polarization of spherical codes and designs
• Universally optimal distribution of points on spheres
• Optimal asymptotic bounds for spherical designs
• Efficient spherical designs with good geometric properties
• Majorization and minimal energy on spheres
• Three-point bounds for energy minimization
• Bounds for spherical codes: the Levenshtein framework lifted
• Spherical designs and modular forms of the \(D_4\) lattice
• Energy bounds for weighted spherical codes and designs via linear programming
• Towards a proof of the 24-cell conjecture
• Designs related through projective and Hopf maps
• Universal lower bounds for potential energy of spherical codes

This page was built for publication: TheD₄Root System Is Not Universally Optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449055)