The kissing problem in three dimensions
From MaRDI portal
Publication:2492641
DOI10.1007/s00454-005-1201-3zbMath1093.52011arXivmath/0410324OpenAlexW2169164634MaRDI QIDQ2492641
Publication date: 14 June 2006
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0410324
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items
The problem of thirteen spheres -- a proof for undergraduates ⋮ Improved Delsarte bounds for spherical codes in small dimensions ⋮ The Tammes Problem for N = 14 ⋮ A short solution of the kissing number problem in dimension three ⋮ Tammes problem and contact number for spheres in spaces of constant curvature ⋮ The magic of 8 and 24 ⋮ The strong thirteen spheres problem ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Delsarte method in the problem on kissing numbers in high-dimensional spaces ⋮ Extremal problems of circle packings on a sphere and irreducible contact graphs ⋮ Face-centered cubic crystallization of atomistic configurations ⋮ Enumeration of irreducible contact graphs on the sphere ⋮ Towards a proof of the 24-cell conjecture ⋮ Bounds for codes by semidefinite programming ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Commutative association schemes
