The six-dimensional Delaunay polytopes
M. Dutour
Abstract
Given a lattice L, a full dimensional polytope P is called a Delaunay polytope if the set of its vertices is S L with S being an empty sphere of the lattice. Extending our previous work DD-hyp on the hypermetric cone HYP7, we classify the six-dimensional Delaunay polytopes according to their combinatorial type. The list of 6241 combinatorial types is obtained by a study of the set of faces of the polyhedral cone HYP7.
Create a lesson
Related papers
The Bézout inequality for mixed volumes characterizes simplices
Dylan Langharst, Shouda Wang
Affine dual Minkowski problem for general measures
Cheng Zhang, Hailin Jin
Algebraically independent distances and rigid metrics
Yoshito Ishiki
On the Geometry of Wasserstein Barycenter II: Riemannian Rigidity, Essential Non-Branching, and Finsler Models
Bang-Xian Han, Deng-Yu Liu
A Weak Topology on Metric Spaces
Armando W. Gutiérrez, Olavi Nevanlinna
Uncentered Blaschke-Santaló inequalities for the Gaussian measure
S. Artstein-Avidan, M. Fradelizi, K. Wyczesany