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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.