Optimality and uniqueness of the \((4,10,1/6)\) spherical code (Q1003633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimality and uniqueness of the (4,10,1/6) spherical code |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality and uniqueness of the \((4,10,1/6)\) spherical code |
scientific article |
Statements
Optimality and uniqueness of the \((4,10,1/6)\) spherical code (English)
0 references
4 March 2009
0 references
Linear programming can be used to obtain many best known bounds for spherical codes, and in some cases even to prove optimality. Here it is shown that linear programming \textit{cannot} be used to prove optimality of a \((4,10,1/6)\) spherical code. Moreover---by utilizing results obtained by the current authors in earlier work such as [Eur. J. Comb. 30, 625--637 (2009; Zbl 1171.94378)]--- it turns out that semidefinite programming \textit{can} be used to prove optimality as well as uniqueness of such a spherical code. The optimal code is the Petersen code.
0 references
linear programming
0 references
Petersen code
0 references
semidefinite programming
0 references
spherical codes
0 references
spherical designs
0 references
0 references
0 references
0.8314770460128784
0 references
0.8121834397315979
0 references
0.8100605010986328
0 references
