Mathematics – Combinatorics
Scientific paper
2008-04-23
J. Reine Angew. Math. 637 (2009), 207-216
Mathematics
Combinatorics
AMS-LaTeX, 9 pages
Scientific paper
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.
Haase Christian
Nill Benjamin
Payne Sam
No associations
LandOfFree
Cayley decompositions of lattice polytopes and upper bounds for h^*-polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cayley decompositions of lattice polytopes and upper bounds for h^*-polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cayley decompositions of lattice polytopes and upper bounds for h^*-polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-104748