The strong thirteen spheres problem

Abstract

The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in 1694. The problem was solved by Schutte and van der Waerden only in 1953. A natural extension of this problem is the strong thirteen spheres problem (or the Tammes problem for 13 points) which asks to find an arrangement and the maximum radius of 13 equal size nonoverlapping spheres touching the unit sphere. In the paper we give a solution of this long-standing open problem in geometry. Our computer-assisted proof is based on a enumeration of the so-called irreducible graphs.

Modified lemma 2, 16 pages, 12 figures. Uploaded program package

References in corpus (1)

• New upper bounds for kissing numbers from semidefinite programming

Cited by in corpus (7)

• From Sticky-Hard-Sphere to Lennard-Jones-Type Clusters
• Optimal packings of congruent circles on a square flat torus
• "Magic" numbers in Smale's 7th problem
• From the separable Tammes problem to extremal distributions of great circles in the unit sphere
• Extreme problems of circle packings on a sphere and irreducible contact graphs
• Linear programming bounds for regular graphs
• An extension the semidefinite programming bound for spherical codes