English

Inequalities and Ehrhart $\delta$-Vectors

Combinatorics 2009-09-24 v2

Abstract

For any lattice polytope PP, we consider an associated polynomial δˉP(t)\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.

Keywords

Cite

@article{arxiv.0801.0873,
  title  = {Inequalities and Ehrhart $\delta$-Vectors},
  author = {Alan Stapledon},
  journal= {arXiv preprint arXiv:0801.0873},
  year   = {2009}
}

Comments

11 pages. v2: minor changes, more detailed proof of Lemma 2.12. To appear in Trans. Amer. Math. Soc

R2 v1 2026-06-21T09:59:58.313Z