Journal article
The Thirteen Spheres: A New Proof
Discrete & computational geometry, Vol.31(4), pp.613-625
03/01/2004
DOI: 10.1007/s00454-003-0819-2
Abstract
The thirteen spheres problem, also known as the Gregory-Newton problem, is to determine the maximum number of three-dimensional spheres that can simultaneously touch a given sphere, where all the spheres have the same radius. The history of the problem goes back to a disagreement between Isaac Newton and David Gregory in 1694. Using a combination of harmonic analysis and linear programming it can be shown that the maximum cannot exceed 13, but in fact 13 is impossible. The standard proof that the maximum is 12 uses an ad hoc construction that does not appear to extend to higher dimensions. In this paper we describe a new proof that uses linear programming bounds and properties of spherical Delaunay triangulations. [PUBLICATION ABSTRACT]
Details
- Title: Subtitle
- The Thirteen Spheres: A New Proof
- Creators
- Kurt Anstreicher - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Discrete & computational geometry, Vol.31(4), pp.613-625
- Publisher
- Springer Nature B.V
- DOI
- 10.1007/s00454-003-0819-2
- ISSN
- 0179-5376
- eISSN
- 1432-0444
- Language
- English
- Date published
- 03/01/2004
- Academic Unit
- Industrial and Systems Engineering; Computer Science; Business Analytics
- Record Identifier
- 9984380527902771
Metrics
51 Record Views