The kissing problem in three dimensions

DOI10.1007/S00454-005-1201-3MaRDI QIDQ2492641zbMATH OpenOpenAlexFDO

Authors Oleg R. Musin

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

zbMATH Keywords

Delsarte's methodkissing numberNewton-Gregory problemsphere packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Abstract: The kissing number k(3) is the maximal number of equal size nonoverlapping spheres in three dimensions that can touch another sphere of the same size. This number was the subject of a famous discussion between Isaac Newton and David Gregory in 1694. The first proof that k(3)=12 was given by Sch"utte and van der Waerden only in 1953. In this paper we present a new solution of the Newton-Gregory problem that uses our extension of the Delsarte method. This proof relies on basic calculus and simple spherical geometry.

Recommendations

• A short solution of the kissing number problem in dimension three
• scientific article; zbMATH DE number 2068101
• The kissing number in four dimensions
• The thirteen spheres: a new proof
• A survey on the kissing numbers.

Cited in

(25)

• A survey on spherical designs and algebraic combinatorics on spheres
• Commutative association schemes
• Bounds for the Newton number in the plane
• The thirteen spheres: a new proof
• Packing twelve spherical caps to maximize tangencies
• Enumeration of irreducible contact graphs on the sphere
• The problem of thirteen spheres -- a proof for undergraduates
• The kissing number in four dimensions
• The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
• Improved Delsarte bounds for spherical codes in small dimensions
• A short solution of the kissing number problem in dimension three
• The Tammes problem for N = 14
• The Kissing Numbers of Convex Bodies - A Brief Survey
• The strong thirteen spheres problem
• scientific article; zbMATH DE number 2068101 (Why is no real title available?)
• Packing, covering and tiling in two-dimensional spaces
• scientific article; zbMATH DE number 2115094 (Why is no real title available?)
• 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
• A survey on the kissing numbers.
• Tammes problem and contact number for spheres in spaces of constant curvature
• The magic of 8 and 24
• Towards a proof of the 24-cell conjecture
• Bounds for codes by semidefinite programming

This page was built for publication: The kissing problem in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492641)