A New Algorithm in Geometry of Numbers
From MaRDI portal
Publication:6207266
DOI10.1109/ISVD.2007.6arXiv0710.4948MaRDI QIDQ6207266FDOQ6207266
Authors: Mathieu Dutour Sikirić, K. A. Rybnikov 
Publication date: 25 October 2007
Abstract: A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.
This page was built for publication: A New Algorithm in Geometry of Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207266)
