arXiv:0801.0873 [math.CO]AbstractReferencesReviewsResources
Inequalities and Ehrhart $δ$-Vectors
Published 2008-01-06, updated 2008-02-23Version 2
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known inequalities satisfied by the coefficients of the Ehrhart $\delta$-vector of a lattice polytope. We also provide combinatorial proofs of two results of Stanley that were previously established using techniques from commutative algebra. Finally, we give a necessary numerical criterion for the existence of a regular unimodular lattice triangulation of the boundary of a lattice polytope.
Comments: 11 pages. v2: minor changes, more detailed proof of Lemma 2.12. To appear in Trans. Amer. Math. Soc
Journal: Trans. Amer. Math. Soc. 361 (2009), 5615-5626.
Categories: math.CO
Subjects: 52B20
Keywords: lattice polytope, inequalities, regular unimodular lattice triangulation, symmetry conditions, combinatorial proofs
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0804.3667 [math.CO] (Published 2008-04-23)
Cayley decompositions of lattice polytopes and upper bounds for h^*-polynomials
arXiv:math/0406485 [math.CO] (Published 2004-06-23)
The reflexive dimension of a lattice polytope
Lattice polytopes of degree 2