Name
Abstract | ||
|---|---|---|
The thirteen spheres problem asks if 13 equal-size non-overlapping spheres in three dimensions can simultaneously 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 Schütte and van der Waerden only in 1953. A natural extension of this problem is the strong thirteen-sphere problem (or the Tammes problem for 13 points), which calls for finding the maximum radius of and an arrangement for 13 equal-size non-overlapping spheres touching the unit sphere. In this paper, we give a solution of this long-standing open problem in geometry. Our computer-assisted proof is based on an enumeration of irreducible graphs. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s00454-011-9392-2 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Planar Graph,Discrete Comput Geom,Regular Triangle,Contact Graph,Sphere Problem | Topology,Graph,Combinatorics,Open problem,Enumeration,SPHERES,Van der Waerden's theorem,Mathematics,Planar graph,Unit sphere | Journal |
Volume | Issue | ISSN |
48 | 1 | Discrete & Computational Geometry, 48:1 (2012), 128-141 |
Citations | PageRank | References |
4 | 0.88 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg R. Musin | 1 | 51 | 11.51 |
| Alexey Tarasov | 2 | 28 | 3.54 |