The complete classification of five-dimensional Dirichlet-Voronoi polyhedra of translational lattices

Abstract

In this paper we report on the full classification of Dirichlet-Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. We obtain a complete list of $110244$ affine types (L-types) of Delaunay subdivisions and it turns out that they are all combinatorially inequivalent, giving the same number of combinatorial types of Dirichlet-Voronoi polyhedra. Using a refinement of corresponding secondary cones, we obtain $181394$ contraction types. We report on details of our computer assisted enumeration, which we verified by three independent implementations and a topological mass formula check.

16 pages

References in corpus (2)

• Computational Approaches to Lattice Packing and Covering Problems
• The decomposition of the hypermetric cone into L-domains

Cited by in corpus (13)

• Schottky Algorithms: Classical meets Tropical
• Voronoi conjecture for five-dimensional parallelohedra
• Iso Edge Domains
• Multiple Lattice Tilings in Euclidean Spaces
• Characterization of the Two-Dimensional Five-Fold Translative Tiles
• On the Voronoi Conjecture for combinatorially Voronoi parallelohedra in dimension five
• Characterization of the Two-Dimensional Six-Fold Lattice Tiles
• The chromatic number of 4-dimensional lattices
• On combinatorics of Voronoi polytopes for perturbations of the dual root lattices
• Twofold Translative Tiles in Three-Dimensional Space
• Periodic triangulations of ${\mathbb{Z}}^n$
• A friendly introduction to Fourier analysis on polytopes
• The Three and Fourfold Translative Tiles in Three-Dimensional Space