Spherical codes and Borsuk's conjecture (Q5957716): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q123218656, #quickstatements; #temporary_batch_1712186161777 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q123218656 / rank | |||
Normal rank |
Revision as of 00:59, 4 April 2024
scientific article; zbMATH DE number 1718959
Language | Label | Description | Also known as |
---|---|---|---|
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