The local optimality of the double lattice packing
classification
🧮 math.MG
keywords
packingdoublekuperberglatticelocaloptimaloptimalitytechnique
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.