Hilbert Polynomials of Calabi Yau Hypersurfaces in Toric Varieties and Lattice Points in Polytope Boundaries
Jonathan Weitsman
TL;DR
The paper proves that the Hilbert polynomial of a Calabi–Yau hypersurface $Z$ in a smooth toric variety $M$ associated to a Delzant polytope $\Delta$ equals the lattice-point count on the boundary $\partial\Delta$, i.e., $\text{ind }\bar{\partial}_{(L^k|_Z)}=\#(k\partial\Delta\cap\mathbb{Z}^m)$. The key technique is a K-theory computation of the Euler class of the normal bundle to $Z$, expressed via the Euler classes of the facet divisors, which mirrors the inclusion-exclusion principle. By decomposing $Z$ into the intersections $D_I$ of facet divisors (each a smooth toric variety) and applying the toric Hilbert-polynomial formula to these pieces, the authors obtain the boundary-lattice count from the ambient lattice-point framework. This yields a geometric proof of the corresponding boundary-lattice-point formula and links geometric quantization to combinatorial lattice-point theory in toric Calabi–Yau settings.
Abstract
We show that the Hilbert polynomial of a Calabi-Yau hypersurface $Z$ in a smooth toric variety $M$ associated to a convex polytope $Δ$ is given by a lattice point count in the polytope boundary $\partial Δ,$ just as the Hilbert polynomial of $M$ is known to be given by a lattice point count in the convex polytope $Δ.$ Our main tool is a computation of the Euler class in $K$-theory of the normal line bundle to the hypersurface $Z,$ in terms of the Euler classes of the divisors corresponding to the facets of the moment polytope. We observe a remarkable parallel between our expression for the Euler class and the inclusion-exclusion principle in combinatorics. To obtain our result we combine these facts with the known relation between lattice point counts in the facets of $Δ$ and the Hilbert polynomials of the smooth toric varieties corresponding to these facets.
