pith. sign in

arxiv: 0804.3667 · v1 · submitted 2008-04-23 · 🧮 math.CO · math.AG

Cayley decompositions of lattice polytopes and upper bounds for h^*-polynomials

classification 🧮 math.CO math.AG
keywords latticecayleybounddecompositionpolytopepolytopestermsupper
0
0 comments X
read the original abstract

We give an effective upper bound on the h^*-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem which says, roughly speaking, that any lattice polytope with a large multiple that has no interior lattice points has a nontrivial decomposition as a Cayley sum of polytopes of smaller dimension. In an appendix, we interpret this result in terms of adjunction theory for toric varieties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.