A new algorithm in geometry of numbers

被引：0

作者：

Dutour, Mathieu ^{[1
]}

Rybnikov, Konstantin ^{[2
]}

机构：

[1] Rudjer Boskovic Inst, Lab Radiochem, Bijenicka 54, Zagreb 41000, Croatia

[2] Univ Massachusetts, Lowell Math Sci, Lowell, MA 01854 USA

来源：

ISVD 2007: THE 4TH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS IN SCIENCE AND ENGINEERING 2007, PROCEEDINGS | 2007年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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 [Du05]. 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.

引用

页码：182 / +

页数：2