Multivariate volume, Ehrhart, and $h^*$-polynomials of polytropes
Marie-Charlotte Brandenburg, Sophia Elia, Leon Zhang

TL;DR
This paper develops methods from toric geometry to compute multivariate volume, Ehrhart, and $h^*$-polynomials of lattice polytropes, providing new combinatorial descriptions and characterizations in low dimensions.
Contribution
It introduces algorithms for multivariate polynomial computation of polytropes and offers a complete combinatorial description for 3D cases, with partial results in 4D.
Findings
Algorithms for multivariate polynomials of polytropes
Complete combinatorial description in 3D
Partial characterization in 4D
Abstract
The univariate Ehrhart and -polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and -polynomials of lattice polytropes, which are both tropically and classically convex. These algorithms are applied to all polytropes of dimensions 2,3 and 4, yielding a large class of integer polynomials. We give a complete combinatorial description of the coefficients of volume polynomials of 3-dimensional polytropes in terms of regular central subdivisions of the fundamental polytope. Finally, we provide a partial characterization of the analogous coefficients in dimension 4.
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 · Polynomial and algebraic computation · Commutative Algebra and Its Applications
