Computational Approaches to Lattice Packing and Covering Problems
arXiv:math/0403272 · doi:10.1007/s00454-005-1202-2
Abstract
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the sense that they approximate optimal covering lattices and optimal packing-covering lattices within any desired accuracy. Both algorithms involve semidefinite programming and are based on Voronoi's reduction theory for positive definite quadratic forms, which describes all possible Delone triangulations of Z^d. In practice, our implementations reproduce known results in dimensions d <= 5 and in particular solve the two problems in these dimensions. For d = 6 our computations produce new best known covering as well as packing-covering lattices, which are closely related to the lattice (E6)*. For d = 7, 8 our approach leads to new best known covering lattices. Although we use numerical methods, we made some effort to transform numerical evidences into rigorous proofs. We provide rigorous error bounds and prove that some of the new lattices are locally optimal.
(v3) 40 pages, 5 figures, 6 tables, some corrections, accepted in Discrete and Computational Geometry, see also http://fma2.math.uni-magdeburg.de/~latgeo/
References in corpus (2)
Cited by in corpus (17)
- Template-based searches for gravitational waves: efficient lattice covering of flat parameter spaces
- Reformulation of the Covering and Quantizer Problems as Ground States of Interacting Particles
- Hybrid geometric-random template placement algorithm for gravitational wave searches from compact binary coalescences
- The complete classification of five-dimensional Dirichlet-Voronoi polyhedra of translational lattices
- A method for dense packing discovery
- Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
- A generalization of Voronoi's reduction theory and its application
- Inhomogeneous extreme forms
- Random Sequential Covering
- Voronoi conjecture for five-dimensional parallelohedra
- Simultaneous packing and covering in sequence spaces
- Methods in the Local Theory of Packing and Covering Lattices
- On the Voronoi Conjecture for combinatorially Voronoi parallelohedra in dimension five
- Lattice Delone simplices with super-exponential volume
- On Generalized Kissing Numbers of Convex Bodies
- Dynamic Space Filling
- When is the ball a local pessimum for covering?