Normal forms of convex lattice polytopes

Authors Roland Grinis, Alexander Kasprzyk

Publication date 28 January 2013

Has companion code repository https://github.com/apaffenholz/polymake_LatticeNormalForm

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Abstract: We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether there exists an affine lattice automorphism that sends P to Q. Methods for calculating the automorphism group and affine automorphism group of P are also described. An alternative strategy is to determine a normal form such that P and Q are isomorphic if and only if their normal forms are equal. This is the approach adopted by Kreuzer and Skarke in their PALP software. We describe the Kreuzer-Skarke method in detail, and give an improved algorithm when P has many symmetries. Numerous examples, plus two appendices containing detailed pseudo-code, should help with any future reimplementations of these techniques. We conclude by explaining how to define and calculate the normal form of a Laurent polynomial.

This page was built for publication: Normal forms of convex lattice polytopes

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