Inequalities and Ehrhart $\delta$-Vectors

By A. Stapledon. 2008

57 citations recorded by the source corpus.

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.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/53615247129edcefdc4c11ab2a6b3a4fd2c8369a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Matthias Beck

In Discrete Mathematics and Combinatorics

  1. Matthias Beck
  2. Jeffrey C. Lagarias

Citations in the corpus