On the classification of reflexive polyhedra (Q1360337): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Maximilian Kreuzer / rank
Normal rank
 
Property / author
 
Property / author: Harald Skarke / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Charles Leytem / rank
Normal rank
 

Revision as of 07:07, 14 February 2024

scientific article
Language Label Description Also known as
English
On the classification of reflexive polyhedra
scientific article

    Statements

    On the classification of reflexive polyhedra (English)
    0 references
    7 September 1998
    0 references
    The Calabi-Yau condition for hypersurfaces of toric varieties is known to be equivalent to the reflexivity of a certain underlying polyhedron defined on an integer lattice. Moreover, the duality of reflexive polyhedra corresponds in this association to the mirror symmetry of the resulting Calabi-Yau manifolds. The authors investigate the geometrical structures of minimal polytopes containing the original polytope, i.e. circumscribed polytopes with a minimal number of facets and inscribed polyhedra with a minimal number of vertices. These objects, which put constraints on reflexive pairs of polyhedra, can be described in terms of certain non-negative integral matrices. A classification algorithm is deduced. This algorithm is proven to be finite and is used to reobtain the known 16 2-dimensional polyhedra. It is also expected to be efficient enough for a classification of polyhedra in dimensions less or equal to 4, this last dimension being relevant for the Calabi-Yau compactifications in string theory.
    0 references
    Calabi-Yau condition
    0 references
    toric varieties
    0 references
    mirror symmetry
    0 references
    minimal polytopes
    0 references
    reflexive pairs of polyhedra
    0 references
    string theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references