arXiv Analytics

Sign in

arXiv:0804.3667 [math.CO]AbstractReferencesReviewsResources

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

Christian Haase, Benjamin Nill, Sam Payne

Published 2008-04-23Version 1

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.

Comments: AMS-LaTeX, 9 pages
Journal: J. Reine Angew. Math. 637 (2009), 207-216
Categories: math.CO, math.AG
Subjects: 52B20, 14M25, 14C20
Related articles: Most relevant | Search more
arXiv:0809.1787 [math.CO] (Published 2008-09-10)
3-Dimensional Lattice Polytopes Without Interior Lattice Points
arXiv:0706.4178 [math.CO] (Published 2007-06-28, updated 2009-01-13)
Lattice polytopes of degree 2
arXiv:math/0406485 [math.CO] (Published 2004-06-23)
The reflexive dimension of a lattice polytope