The problem of the twenty-five spheres (Q4829637)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2120344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The problem of the twenty-five spheres |
scientific article; zbMATH DE number 2120344 |
Statements
The problem of the twenty-five spheres (English)
0 references
29 November 2004
0 references
kissing number of spheres
0 references
spherical codes
0 references
Delsarte's method
0 references
0.8660714030265808
0 references
0.8245076537132263
0 references
0.8226096630096436
0 references
0.8181567788124084
0 references
The following theorem and a sketch of its proof is presented. The maximum number of non-intersecting unit spheres in four-dimensional Euclidean space that can simultaneously touch another unit sphere is \(24\). It has long been known that a kissing configuration of \(24\) spheres exists; the difficulty was in proving the upper bound. The proof uses a modification of Delsarte's method for finding upper bounds for spherical codes. An extended version of the proof may be found at [\textit{O. R. Musin}, The kissing number in four dimensions, www.arxiv.org/abs/math.MG/0309430].
0 references
