Volume 15, issue 4 (2011)

Download this article
Download this article For screen
For printing
Recent Issues

Volume 28
Issue 6, 2483–2999
Issue 5, 1995–2482
Issue 4, 1501–1993
Issue 3, 1005–1499
Issue 2, 497–1003
Issue 1, 1–496

Volume 27, 9 issues

Volume 26, 8 issues

Volume 25, 7 issues

Volume 24, 7 issues

Volume 23, 7 issues

Volume 22, 7 issues

Volume 21, 6 issues

Volume 20, 6 issues

Volume 19, 6 issues

Volume 18, 5 issues

Volume 17, 5 issues

Volume 16, 4 issues

Volume 15, 4 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 5 issues

Volume 11, 4 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 3 issues

Volume 7, 2 issues

Volume 6, 2 issues

Volume 5, 2 issues

Volume 4, 1 issue

Volume 3, 1 issue

Volume 2, 1 issue

Volume 1, 1 issue

The Journal
About the Journal
Editorial Board
Editorial Procedure
Subscriptions
 
Submission Guidelines
Submission Page
Policies for Authors
Ethics Statement
 
ISSN 1364-0380 (online)
ISSN 1465-3060 (print)
Author Index
To Appear
 
Other MSP Journals
Rigidity of spherical codes

Henry Cohn, Yang Jiao, Abhinav Kumar and Salvatore Torquato

Geometry & Topology 15 (2011) 2235–2273
Abstract

A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be deformed. In this paper, we systematically study the rigidity of spherical codes, particularly kissing configurations. One surprise is that the kissing configuration of the Coxeter–Todd lattice is not jammed, despite being locally jammed (each individual cap is held in place if its neighbors are fixed); in this respect, the Coxeter–Todd lattice is analogous to the face-centered cubic lattice in three dimensions. By contrast, we find that many other packings have jammed kissing configurations, including the Barnes–Wall lattice and all of the best kissing configurations known in four through twelve dimensions. Jamming seems to become much less common for large kissing configurations in higher dimensions, and in particular it fails for the best kissing configurations known in 25 through 31 dimensions. Motivated by this phenomenon, we find new kissing configurations in these dimensions, which improve on the records set in 1982 by the laminated lattices.

Additional material
Keywords
rigidity, jamming, packing, spherical codes, kissing problem
Mathematical Subject Classification 2000
Primary: 52C25
Secondary: 52C17
References
Publication
Received: 24 February 2011
Revised: 23 May 2011
Accepted: 3 June 2011
Published: 23 November 2011
Proposed: Rob Kirby
Seconded: Dmitri Burago, Joan Birman
Authors
Henry Cohn
Microsoft Research New England
One Memorial Drive
Cambridge, MA 02142
Yang Jiao
Physical Sciences–Oncology Center
Princeton University
Princeton, New Jersey 08544
Abhinav Kumar
Department of Mathematics
Massachusetts Institute of Technology
Cambridge, MA 02139
Salvatore Torquato
Department of Chemistry
Princeton University
Princeton, New Jersey 08544