Bounding the Kreuzer‐Skarke Landscape

Abstract

AbstractWe study Calabi‐Yau threefolds with large Hodge numbers by constructing and counting triangulations of reflexive polytopes. By counting points in the associated secondary polytopes, we show that the number of fine, regular, star triangulations of polytopes in the Kreuzer‐Skarke list is bounded above by . Adapting a result of Anclin on triangulations of lattice polygons, we obtain a bound on the number of triangulations of each 2‐face of each polytope in the list. In this way we prove that the number of topologically inequivalent Calabi‐Yau hypersurfaces arising from the Kreuzer‐Skarke list is bounded above by 10428. We introduce efficient algorithms for constructing representative ensembles of Calabi‐Yau hypersurfaces, including the extremal case , and we study the distributions of topological and physical data therein. Finally, we demonstrate that neural networks can accurately predict these data once the triangulation is encoded in terms of the secondary polytope.