Optimality and uniqueness of the (4,10,1/6) spherical code

DOI10.1016/J.JCTA.2008.05.001MaRDI QIDQ1003633zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

linear programmingsemidefinite programmingspherical designsspherical codesPetersen code

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Other types of codes (94B60)

Abstract: Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code.

Recommendations

• scientific article; zbMATH DE number 1188988
• Upper bounds on the minimum distance of spherical codes
• On linear programming bounds for spherical codes and designs
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• A spherical code

Cites work

• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 1231230 (Why is no real title available?)
• A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)
• 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
• Gröbner bases and triangulations of the second hypersimplex
• New upper bounds for kissing numbers from semidefinite programming
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• Spherical codes and designs
• Strongly regular graphs having strongly regular subconstituents
• Uniqueness of the \((22,891,1/4)\) spherical code
• Universally optimal distribution of points on spheres
• Unsolved problems in geometry

Cited in

(16)

• A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
• Three-point bounds for energy minimization
• Towards a proof of the 24-cell conjecture
• scientific article; zbMATH DE number 4047602 (Why is no real title available?)
• Biangular lines revisited
• Unique optima of the Delsarte linear program
• Apollonian ball packings and stacked polytopes
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
• Globally optimizing small codes in real projective spaces
• Linear programming bounds for regular graphs
• A survey on spherical designs and algebraic combinatorics on spheres
• Uniqueness of Certain Spherical Codes
• A spherical code
• Uniqueness of the \((22,891,1/4)\) spherical code
• Exact Semidefinite Programming Bounds for Packing Problems
• Invariant Semidefinite Programs

Describes a project that uses

Uses Software

• CSDP

This page was built for publication: Optimality and uniqueness of the \((4,10,1/6)\) spherical code

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