Mathematics – Metric Geometry
Scientific paper
2004-03-16
Discrete and Computational Geometry 35 (2006), 73-116
Mathematics
Metric Geometry
(v3) 40 pages, 5 figures, 6 tables, some corrections, accepted in Discrete and Computational Geometry, see also http://fma2.
Scientific paper
10.1007/s00454-005-1202-2
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.
Schuermann Achill
Vallentin Frank
No associations
LandOfFree
Computational Approaches to Lattice Packing and Covering Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computational Approaches to Lattice Packing and Covering Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Approaches to Lattice Packing and Covering Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-574564