Abstract:
Reflexive polyhedra encode the combinatorial data for mirror pairs of Calabi–Yau hypersurfaces in toric varieties. We investigate the geometrical structures of circumscribed polytopes with a minimal number of facets and of inscribed polytopes with a minimal number of vertices. These objects, which constrain reflexive pairs of polyhedra from the interior and the exterior, can be described in terms of certain non-negative integral matrices. A major tool in the classification of these matrices is the existence of a pair of weight systems, indicating a relation to weighted projective spaces. This is the cornerstone for an algorithm for the construction of all dual pairs of reflexive polyhedra that we expect to be efficient enough for an enumerative classification in up to 4 dimensions, which is the relevant case for Calabi–Yau compactifications in string theory.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 11 January 1996 / Accepted: 26 November 1996
Rights and permissions
About this article
Cite this article
Kreuzer, M., Skarke, H. On the Classification of Reflexive Polyhedra . Comm Math Phys 185, 495–508 (1997). https://doi.org/10.1007/s002200050100
Issue Date:
DOI: https://doi.org/10.1007/s002200050100