Finite and Uniform Stability of Sphere Packings
- Cite this article as:
- Bezdek, A., Bezdek, K. & Connelly, R. Discrete Comput Geom (1998) 20: 111. doi:10.1007/PL00009374
The main purpose of this paper is to discuss how firm or steady certain known ball packing are, thinking of them as structures. This is closely related to the property of being locally maximally dense. Among other things we show that many of the usual best-known candidates, for the most dense packings with congruent spherical balls, have the property of being uniformly stable, i.e., for a sufficiently small ε > 0 every finite rearrangement of the balls of this packing, where no ball is moved more than ε , is the identity rearrangement. For example, the lattice packings Dd and Ad for d ≥ 3 in Ed are all uniformly stable. The methods developed here can work for many other packings as well. We also give a construction to show that the densest cubic lattice ball packing in Ed for d ≥ 2 is not uniformly stable.
A packing of balls is called finitely stable if any finite subfamily of the packing is fixed by its neighbors. If a packing is uniformly stable, then it is finitely stable. On the other hand, the cubic lattice packings mentioned above, which are not uniformly stable, are nevertheless finitely stable.