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

This paper reports on the full classification of Dirichlet–Voronoi polyhedra and Delaunay subdivisions of five‐dimensional translational lattices. A complete list is obtained of 110 244 affine types (L‐types) of Delaunay subdivisions and it turns out that they are all combinatorially inequivalent, g...

Full description

Saved in:
Bibliographic Details
Published in:Acta crystallographica. Section A, Foundations and advances Foundations and advances, 2016-11, Vol.72 (6), p.673-683
Main Authors: Dutour Sikirić, Mathieu, Garber, Alexey, Schürmann, Achill, Waldmann, Clara
Format: Article
Language:English
Subjects:
affine types
Classification
combinatorial enumeration
contraction types
Crystallography
Delaunay polytope
Dirichlet problem
Dirichlet-Voronoi polytope
Lattice theory
secondary cones
topological mass formula
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper reports on the full classification of Dirichlet–Voronoi polyhedra and Delaunay subdivisions of five‐dimensional translational lattices. A complete list is obtained of 110 244 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, 181 394 contraction types are obtained. The paper gives details of the computer‐assisted enumeration, which was verified by three independent implementations and a topological mass formula check. The five‐dimensional Dirichlet–Voronoi polyhedra of lattices and their contraction types are classified. Computational enumeration yields 110 244 affine types and 181 394 contraction types.
ISSN:2053-2733
0108-7673
2053-2733
DOI:10.1107/S2053273316011682