Five-Dimensional Kissing Number
Canonical statement
View source LaTeX
Let
\(S^4=\{x\in\mathbb R^5:\lVert x\rVert_2=1\}\). Determine
\[
\tau_5=\max\bigl\{|X|:X\subset S^4,\
\langle x,y\rangle\leq\tfrac12
\text{ for all distinct }x,y\in X\bigr\}.
\]
Equivalently, \(\tau_5\) is the maximum number of nonoverlapping unit
\(5\)-balls that can simultaneously touch a fixed unit \(5\)-ball.Notes
The kissing number is the maximum number of nonoverlapping unit balls in that can simultaneously touch a fixed central unit ball; equivalently, it is the largest number of points on the unit sphere with pairwise angular distance at least . Dimension five is the smallest dimension in which this classical quantity is unknown; it is a canonical open case of a long-standing problem rather than a conjecture with a single date of origin.
The values , and are classical, was proved by Musin [Musin2008Kissing], and the answers in dimensions and are also known. In dimension five the root system yields touching balls, and this configuration is widely expected to be optimal. On the other side, semidefinite-programming bounds, which strengthen the classical linear-programming approach to packing problems [deLaatOliveiraVallentin2014], give , so at present . Recent work of Cohn and Rajagopal studies variations on five-dimensional sphere packings [CohnRajagopal2026Five].
The problem remains open: settling it requires either a configuration of more than spheres or an upper bound below .
References (3)
- [Musin2008Kissing]
The kissing number in four dimensions
Open ↗Oleg R. Musin · 2008 · misc
- [deLaatOliveiraVallentin2014]
Upper bounds for packings of spheres of several radii
Open ↗David de Laat and Fernando Mário de Oliveira Filho and Frank Vallentin · 2014 · misc
- [CohnRajagopal2026Five]
Variations on five-dimensional sphere packings
Open ↗Henry Cohn and Isaac Rajagopal · 2026 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.