2004/08/09 by Robert Erdahl, Erdahl, Robert, Andrei Ordine +3
Computer Science · Mathematics · Physics and Astronomy · #52C07 #52C22 #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Metric Geometry (math.MG) #Number Theory (math.NT) #Point processes and geometric inequalities #Primary: 11H50 and 11H55. Secondary: 11H06 #Quantum Physics (quant-ph) #cs.CC #cs.CG #math.MG #math.NT #msc:11H06 #msc:11H50 #msc:11H55. #msc:52C07 #msc:52C22 #quant-ph
paper · pdf · doi:10.48550/arxiv.math/0408122
Release 3: 25 pages, 4 diagrams. A number of errors in notation, terminology, citations, and cross-references have been fixed. Note that in all diagrams kappa should read as k. A reduced 10 page version of this article will apear in the proceedings of the 2003 Voronoi Conference held in Kiev in September of 2003
openalex publication_date 2004/08/09 · arxiv created 2005/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A lattice Delaunay polytope D is called perfect if it has the property that there is a unique circumscribing ellipsoid with interior free of lattice points, and with the surface containing only those lattice points that are the vertices of D. An inhomogeneous quadratic form is called perfect if it is determined by such a circumscribing ''empty ellipsoid'' uniquely up to a scale factor. Perfect inhomogeneous forms are associated with perfect Delaunay polytopes in much the way that perfect homogeneous forms are associated with perfect point lattices. We have been able to construct some 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 are intimately related to the theory of Delaunay polytopes, and to Voronoi's theory of lattice types.