Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter November 23, 2009

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

  • Christian Haase , Benjamin Nill and Sam Payne

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.

Polytopes with nontrivial Cayley decompositions correspond to projectivized sums of toric line bundles, and our approach is partially inspired by classification results of Fujita and others in algebraic geometry. In an appendix, we interpret our Cayley decomposition theorem in terms of adjunction theory for toric varieties.

Received: 2008-05-20
Revised: 2008-09-04
Published Online: 2009-11-23
Published in Print: 2009-December

© Walter de Gruyter Berlin · New York 2009

Downloaded on 14.5.2024 from https://www.degruyter.com/document/doi/10.1515/CRELLE.2009.096/html
Scroll to top button