Optimization Online


The Thirteen Spheres: A New Proof

K.M. Anstreicher (kurt-anstreicher***at***uiowa.edu)

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 argumnet 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.

Keywords: Kissing problem, spherical codes, Voronoi decomposition, Delaunay triangulation

Category 1: Applications -- Science and Engineering (Basic Sciences Applications )

Citation: Dept. of Management Sciences, University of Iowa, Iowa City, October 2002.

Download: [PDF]

Entry Submitted: 10/28/2002
Entry Accepted: 10/28/2002
Entry Last Modified: 10/28/2002

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society