Ehrhart-Equivalence, Equidecomposability, and Unimodular Equivalence of Integral Polytopes
Fiona Abney-McPeek, Sanket Biswas, Senjuti Dutta, Yongyuan Huang,, Deyuan Li, Nancy Xu

TL;DR
This paper explores the relationships between Ehrhart-equivalence, equidecomposability, and unimodular equivalence of integral polytopes, proposing conjectures, algorithms, and new theoretical insights into their classification.
Contribution
It establishes connections between different equivalence notions of integral polytopes, introduces an algorithm for unimodular equivalence, and proves the existence of non-equivalent simplices in all dimensions.
Findings
Proposes a conjecture relating Ehrhart-equivalence and equidecomposability.
Develops an algorithm to determine unimodular equivalence of simplices.
Proves the existence of non-unimodular equivalent simplices in all dimensions.
Abstract
Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral -polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known when two polytopes have equivalent Ehrhart polynomials. In this paper, we establish a relationship between Ehrhart-equivalence and other forms of equivalence: the -equidecomposability and unimodular equivalence of two integral -polytopes in . We conjecture that any two Ehrhart-equivalent integral -polytopes are -equidecomposable into -th unimodular simplices, thereby generalizing the known cases of . We also create an algorithm to check for unimodular equivalence of any two integral -simplices in .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · graph theory and CDMA systems · Finite Group Theory Research
