The local optimality of the double lattice packing
arXiv:1509.02241 · doi:10.1007/s00454-016-9792-4
Abstract
This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and Kuperberg is also locally optimal in the full space of packings.
arXiv commentSource files include Mathematica notebooks implementing calculations
References in corpus (7)
- New upper bounds on sphere packings I
- Dense Regular Packings of Irregular Non-Convex Particles
- Improved sphere packing lower bounds from Hurwitz lattices
- Notions of denseness
- Upper bound on the packing density of regular tetrahedra and octahedra
- The 3-ball is a local pessimum for packing
- Pessimal packing shapes