How to compute the rank of a Delaunay polytope

DOI10.1016/J.EJC.2005.12.007MaRDI QIDQ872032zbMATH OpenOpenAlexFDO

Authors Mathieu Dutour Sikirić, Viacheslav Grishukhin

Publication date 27 March 2007

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0512193

zbMATH Keywords

latticesVoronoi polytopesDelaunay polytopeshypermetrics

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Abstract: Roughly speaking, the rank of a Delaunay polytope (first introduced in cite{DGL92}) is its number of degrees of freedom. In cite{DL}, a method for computing the rank of a Delaunay polytope $P$ using the hypermetrics related to $P$ is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.

Recommendations

• Delaunay transformations of a Delaunay polytope
• The hypermetric cone and polytope on eight vertices and some generalizations
• Adjacency method for extreme Delaunay polytopes
• The six-dimensional Delaunay polytopes
• Affine types of L-polyhedra for five-dimensional lattices.

Cites work

• Geometry of cuts and metrics
• Non-rigidity degree of a lattice and rigid lattices
• The six-dimensional Delaunay polytopes

Cited in

(3)

• Delaunay polytopes derived from the Leech lattice
• Infinite series of extreme Delaunay polytopes
• Delaunay transformations of a Delaunay polytope

This page was built for publication: How to compute the rank of a Delaunay polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872032)