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

DOI10.1016/J.JCTA.2008.05.001zbMATH Open1160.94018arXiv0708.3947OpenAlexW2119346580MaRDI QIDQ1003633FDOQ1003633

Authors: Christine Bachoc, Frank Vallentin 

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0708.3947

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

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)

Cites Work

• CSDP, A C library for semidefinite programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Universally optimal distribution of points on spheres
• Title not available (Why is that?)
• Unsolved problems in geometry
• Spherical codes and designs
• Uniqueness of the \((22,891,1/4)\) spherical code
• New upper bounds for kissing numbers from semidefinite programming
• Strongly regular graphs having strongly regular subconstituents
• Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
• Designs as maximum codes in polynomial metric spaces
• Gröbner bases and triangulations of the second hypersimplex
• Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
• A note on the tight spherical 7-design in \(\mathbb R^{23}\) and 5-design in \(\mathbb R^7\)

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
• Title not available (Why is that?)
• Biangular lines revisited
• Unique optima of the Delsarte linear program
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
• Apollonian ball packings and stacked polytopes
• 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

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)