Lattices compatible with regular polytopes

DOI10.1016/J.EJC.2008.01.005MaRDI QIDQ2519784zbMATH OpenOpenAlexFDO

Authors Peter McMullen

Publication date 27 January 2009

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

Full work available at URL https://doi.org/10.1016/j.ejc.2008.01.005

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Review text

Karpenkov has classified the lattice polytopes (that is, with vertices in the integer lattice \(\mathbb Z^d\)) which are regular with respect to those affinities which preserve the lattice. An alternative dual approach is adopted in this paper. For each regular polytope \(P\) in euclidean space \(\mathbb E^d\), those lattices \(\varLambda \) are classified which are compatible with \(P\), in the sense that some translate of \(\varLambda \) contains the vertices of \(P\), and this translate is preserved by the symmetries of \(P\).

Recommendations

• Regular lattice polytopes and root systems
• Embedding a polytope in a lattice
• Regular polyhedra in the 3-torus
• scientific article; zbMATH DE number 863488
• scientific article; zbMATH DE number 3915097

Cites work

• Abstract Regular Polytopes
• Affinely and Projectively Regular Polytopes
• Classification of lattice-regular lattice convex polytopes
• Higher toroidal regular polytopes
• scientific article; zbMATH DE number 3407710 (Why is no real title available?)
• Regular polytopes of full rank

Cited in

(3)

• Regular lattice polytopes and root systems
• Polytopes with Mass Linear Functions II: The Four-Dimensional Case
• Classification of lattice-regular lattice convex polytopes

This page was built for publication: Lattices compatible with regular polytopes

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