Affine types of \(L\)-polyhedra for five-dimensional lattices. (Q1810086)

An \(n\)-dimensional \(L\)-polyhedron, often called Delaunay polytope, is a convex \(n\)-dimensional polytope with vertices taken from a lattice \(L\subset R^n\), such that its circumball (i) contains no other lattice points and (ii) contains all of the vertices on its boundary. For a given \(n\) there exist only finitely many \(L\)-polyhedra up to ``affine equivalence''. These ``affine types'' where determined for \(n=2,3\) by Delaunay and \(n=4\) by Erdahl and Ryshkov. In the paper under review, the author describes an algorithm which he successfully uses to enumerate all five-dimensional affine types. In particular, the correspondence between \(n\)--dimensional \(L\)-polyhedra and faces of the hypermetric cone \(H_{n+1}\) is exploited. Recently, \textit{M. Dutour} [Eur. J. Comb. 25, 535--548 (2004)] gave a classification for \(n=6\) with a similar approach.