177 research outputs found

    Combinatorially two-orbit convex polytopes

    Full text link
    Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide.) Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, icosidodecahedron, rhombic dodecahedron, or rhombic triacontahedron. The same is true of combinatorially two-orbit normal face-to-face tilings by convex polytopes.Comment: 20 page

    Combinatorial Space Tiling

    Full text link
    The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and some old open problems in this area.Comment: 16 pages; to appear in "Symmetry: Culture and Science

    Optimally Dense Packings for Fully Asymptotic Coxeter Tilings by Horoballs of Different Types

    Full text link
    The goal of this paper to determine the optimal horoball packing arrangements and their densities for all four fully asymptotic Coxeter tilings (Coxeter honeycombs) in hyperbolic 3-space H3\mathbb{H}^3. Centers of horoballs are required to lie at vertices of the regular polyhedral cells constituting the tiling. We allow horoballs of different types at the various vertices. Our results are derived through a generalization of the projective methodology for hyperbolic spaces. The main result states that the known B\"or\"oczky--Florian density upper bound for "congruent horoball" packings of H3\mathbb{H}^3 remains valid for the class of fully asymptotic Coxeter tilings, even if packing conditions are relaxed by allowing for horoballs of different types under prescribed symmetry groups. The consequences of this remarkable result are discussed for various Coxeter tilings.Comment: 26 pages, 10 figure

    Semi-equivelar toroidal maps and their vertex covers

    Full text link
    If the face\mbox{-}cycles at all the vertices in a map are of same type then the map is called semi\mbox{-}equivelar. A map is called minimal if the number of vertices is minimal. We know the bounds of number of vertex orbits of semi-equivelar toroidal maps. These bounds are sharp. Datta \cite{BD2020} has proved that every semi-equivelar toroidal map has a vertex-transitive cover. In this article, we prove that if a semi-equivelar map is kk orbital then it has a finite index mm-orbital minimal cover for m≤km \le k. We also show the existence and classification of nn-sheeted covers of semi-equivelar toroidal maps for each n∈Nn \in \mathbb{N}

    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

    Clusters of Cycles

    Full text link
    A {\it cluster of cycles} (or {\it (r,q)(r,q)-polycycle}) is a simple planar 2--co nnected finite or countable graph GG of girth rr and maximal vertex-degree qq, which admits {\it (r,q)(r,q)-polycyclic realization} on the plane, denote it by P(G)P(G), i.e. such that: (i) all interior vertices are of degree qq, (ii) all interior faces (denote their number by prp_r) are combinatorial rr-gons and (implied by (i), (ii)) (iii) all vertices, edges and interior faces form a cell-complex. An example of (r,q)(r,q)-polycycle is the skeleton of (rq)(r^q), i.e. of the qq-valent partition of the sphere S2S^2, Euclidean plane R2R^2 or hyperbolic plane H2H^2 by regular rr-gons. Call {\it spheric} pairs (r,q)=(3,3),(3,4),(4,3),(3,5),(5,3)(r,q)=(3,3),(3,4),(4,3),(3,5),(5,3); for those five pairs P(rq)P(r^q) is (rq)(r^q) without the exterior face; otherwise P(rq)=(rq)P(r^q)=(r^q). We give here a compact survey of results on (r,q)(r,q)-polycycles.Comment: 21. to in appear in Journal of Geometry and Physic
    • …
    corecore