Papers › Normal forms of convex lattice polytopes
Normal forms of convex lattice polytopes
Roland Grinis, Alexander Kasprzyk
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections