52 research outputs found

    Computing symmetry groups of polyhedra

    Full text link
    Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used for instance in integer linear programming.Comment: 20 pages, 1 figure; containing a corrected and improved revisio

    The generalized Mukai conjecture for symmetric varieties

    Full text link
    We associate to any complete spherical variety XX a certain nonnegative rational number ℘(X)\wp(X), which we conjecture to satisfy the inequality ℘(X)≀dim⁥X−rank⁥X\wp(X) \le \operatorname{dim} X - \operatorname{rank} X with equality holding if and only if XX is isomorphic to a toric variety. We show that, for spherical varieties, our conjecture implies the generalized Mukai conjecture on the pseudo-index of smooth Fano varieties due to Bonavero, Casagrande, Debarre, and Druel. We also deduce from our conjecture a smoothness criterion for spherical varieties. It follows from the work of Pasquier that our conjecture holds for horospherical varieties. We are able to prove our conjecture for symmetric varieties.Comment: 33 pages, 2 figures, 6 table

    Reflexive polytopes of higher index and the number 12

    Get PDF
    We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another application, we show that any reflexive polygon of arbitrary index satisfies the famous "number 12" property. This is a new, infinite class of lattice polygons possessing this property, and extends the previously known sixteen instances. The number 12 property also holds more generally for l-reflexive non-convex or self-intersecting polygonal loops. We conclude by discussing higher-dimensional examples and open questions.Comment: Dedicated to the memory of Maximilian Kreuzer. 23 pages, 4 figures, 4 tables, an appendix containing Magma source cod

    Reflexive polytopes of higher index and the number 12

    Get PDF
    We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another application, we show that any reflexive polygon of arbitrary index satisfies the famous "number 12" property. This is a new, infinite class of lattice polygons possessing this property, and extends the previously known sixteen instances. The number 12 property also holds more generally for l-reflexive non-convex or self-intersecting polygonal loops. We conclude by discussing higher-dimensional examples and open questions

    ℓ1-Rigid Graphs.

    Get PDF

    Polygonal Complexes and Graphs for Crystallographic Groups

    Full text link
    The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the classification of regular polygonal complexes, chiral polyhedra, and more generally, two-orbit polyhedra.Comment: 21 pages; In: Symmetry and Rigidity, (eds. R.Connelly, A.Ivic Weiss and W.Whiteley), Fields Institute Communications, to appea

    A Calabi-Yau Database: Threefolds Constructed from the Kreuzer-Skarke List

    Get PDF
    Kreuzer and Skarke famously produced the largest known database of Calabi-Yau threefolds by providing a complete construction of all 473,800,776 reflexive polyhedra that exist in four dimensions [1]. These polyhedra describe the singular limits of ambient toric varieties in which Calabi-Yau threefolds can exist as hypersurfaces. In this paper, we review how to extract topological and geometric information about Calabi-Yau threefolds using the toric construction, and we provide, in a companion online database (see http://​nuweb1.​neu.​edu/​cydatabase), a detailed inventory of these quantities which are of interest to physicists. Many of the singular ambient spaces described by the Kreuzer-Skarke list can be smoothed out into multiple distinct toric ambient spaces describing different Calabi-Yau threefolds. We provide a list of the different Calabi-Yau threefolds which can be obtained from each polytope, up to current computational limits. We then give the details of a variety of quantities associated to each of these Calabi-Yau such as Chern classes, intersection numbers, and the KĂ€hler and Mori cones, in addition to the Hodge data. This data forms a useful starting point for a number of physical applications of the Kreuzer-Skarke list
    • 

    corecore