Spherical codes and Borsuk's conjecture (Q5957716)
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: Spherical codes and Borsuk's conjecture |
scientific article; zbMATH DE number 1718959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spherical codes and Borsuk's conjecture |
scientific article; zbMATH DE number 1718959 |
Statements
Spherical codes and Borsuk's conjecture (English)
0 references
15 May 2003
0 references
The author shows that the unit sphere of Euclidean space \(E^{323}\) contains a finite set \(F\) of points which cannot be partitioned into 561 sets of diameters smaller than the diameter of \(F\). Thus the well-known Borsuk's conjecture fails in every space \(E^n\) with \(n\geq 323\). The construction is based on the subset of vectors of minimal length in the Leech lattice.
0 references
spherical codes
0 references
diameter
0 references
Borsuk's conjecture
0 references
Leech lattice
0 references
0.8727403879165649
0 references
0.8457576036453247
0 references
0.8296309113502502
0 references
0.8276557326316833
0 references
0.8200838565826416
0 references