Optimality and uniqueness of the \((4,10,1/6)\) spherical code
From MaRDI portal
Publication:1003633
DOI10.1016/j.jcta.2008.05.001zbMath1160.94018arXiv0708.3947OpenAlexW2119346580MaRDI QIDQ1003633
Christine Bachoc, Frank Vallentin
Publication date: 4 March 2009
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3947
Semidefinite programming (90C22) Linear programming (90C05) Other types of codes (94B60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items
Apollonian ball packings and stacked polytopes ⋮ Three-point bounds for energy minimization ⋮ Linear programming bounds for regular graphs ⋮ A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4 ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Biangular lines revisited ⋮ Towards a proof of the 24-cell conjecture ⋮ Invariant Semidefinite Programs ⋮ Exact Semidefinite Programming Bounds for Packing Problems ⋮ A survey on spherical designs and algebraic combinatorics on spheres
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Strongly regular graphs having strongly regular subconstituents
- Unsolved problems in geometry
- Designs as maximum codes in polynomial metric spaces
- Spherical codes and designs
- A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)
- Gröbner bases and triangulations of the second hypersimplex
- Uniqueness of the \((22,891,1/4)\) spherical code
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Universally optimal distribution of points on spheres
- New upper bounds for kissing numbers from semidefinite programming
- CSDP, A C library for semidefinite programming
