English

Perfect Delaunay Polytopes and Perfect Quadratic Functions on Lattices

Number Theory 2007-05-23 v1 Metric Geometry

Abstract

A polytope DD whose vertices belong to a lattice of rank dd is Delaunay if there is a circumscribing dd-dimensional ellipsoid, EE, with interior free of lattice points so that the vertices of DD lie on EE. If in addition, the ellipsoid EE is uniquely determined by DD, we call DD perfect. That is, a perfect Delaunay polytope is a lattice polytope with a circumscribing empty ellipsoid EE, where the quadratic surface E\partial E both contains the vertices of DD and is determined by them. We have been able to construct infinite sequences of perfect Delaunay polytopes, one perfect polytope in each successive dimension starting at some initial dimension; we have been able to construct an infinite number of such infinite sequences. Perfect Delaunay polytopes play an important role in the theory of Delaunay polytopes, and in Voronoi's theory of lattice types.

Keywords

Cite

@article{arxiv.math/0701006,
  title  = {Perfect Delaunay Polytopes and Perfect Quadratic Functions on Lattices},
  author = {Robert Erdahl and Andrei Ordine and Konstantin Rybnikov},
  journal= {arXiv preprint arXiv:math/0701006},
  year   = {2007}
}

Comments

24 pages, including 2 figures