Problems on Polytopes, Their Groups, and Realizations

The paper gives a collection of open problems on abstract polytopes that were either presented at the Polytopes Day in Calgary or motivated by discussions at the preceding Workshop on Convex and Abstract Polytopes at the Banff International Research Station in May 2005.Comment: 25 pages (Periodica Mathematica Hungarica, Special Issue on Discrete Geometry, to appear

Polygonal Complexes and Graphs for Crystallographic Groups

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

Hereditary Polytopes

Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary, but the other polytopes in this class are interesting, have possible applications in modeling of structures, and have not been previously investigated. This paper establishes the basic theory of hereditary polytopes, focussing on the analysis and construction of hereditary polytopes with highly symmetric faces.Comment: Discrete Geometry and Applications (eds. R.Connelly and A.Ivic Weiss), Fields Institute Communications, (23 pp, to appear

Computing symmetry groups of polyhedra

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

An Abundance of K3 Fibrations from Polyhedra with Interchangeable Parts

Even a cursory inspection of the Hodge plot associated with Calabi-Yau threefolds that are hypersurfaces in toric varieties reveals striking structures. These patterns correspond to webs of elliptic-K3 fibrations whose mirror images are also elliptic-K3 fibrations. Such manifolds arise from reflexive polytopes that can be cut into two parts along slices corresponding to the K3 fibers. Any two half-polytopes over a given slice can be combined into a reflexive polytope. This fact, together with a remarkable relation on the additivity of Hodge numbers, explains much of the structure of the observed patterns.Comment: 30 pages, 15 colour figure