Perfect Delaunay Polytopes and Perfect Quadratic Functions on Lattices
Abstract
A polytope whose vertices belong to a lattice of rank is Delaunay if there is a circumscribing -dimensional ellipsoid, , with interior free of lattice points so that the vertices of lie on . If in addition, the ellipsoid is uniquely determined by , we call perfect. That is, a perfect Delaunay polytope is a lattice polytope with a circumscribing empty ellipsoid , where the quadratic surface both contains the vertices of 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