Vertex-Transitive Polyhedra in 3-Space
نویسنده
چکیده
In addition to regular and chiral polyhedra, which have been extensively studied, the vertextransitive polyhedra of higher genus also present an attractive and worthwhile challenge. While the definition is combinatorial, the problem at hand is the realization in Euclidean 3-space as a highly symmetric, non-self-intersecting polyhedron in the more classical sense (with flat, non-self-intersecting faces). This abstract provides an overview of the topic as well as work in progress.
منابع مشابه
Hidden Symmetries in the Snub Dodecahedron
In a 1979 paper by Coxeter and Huybers [4] , simple formulas were given to construct the snub cube and the snub dodecahedron from the octahedron and the icosahedron respectively , the vertices of the octahedron and icosahedron being the intersection points of certain pairs of edges of the two snub polyhedra . In a later series of papers , Hohenberg [6 , 7 , 8] studied the intersection points of...
متن کاملRegular Polygonal Complexes in Space, Ii
Regular polygonal complexes in euclidean 3-space E3 are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The present paper and its predecessor describe a complete classification of regular polygonal complexes in E3. In Part I we established basic structural results ...
متن کاملPolyhedra, complexes, nets and symmetry.
Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial and algebraic properties. They can be viewed as finite or infinite 3-periodic graphs (nets) equipped with additional structure imposed by the faces, allowed to be skew, zigzag or helical. A polyhedron or complex is regular if its geometr...
متن کاملCharacterization and Construction of a Family of Highly Symmetric Spherical Polyhedra with Application in Modeling Self-Assembling Structures
The regular polyhedra have the highest order of 3D symmetries and are exceptionally attractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass domes. However, they only represent a small number of possible spherical layouts which can serve as templates for symmetric assembly. In this paper, we formal...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کامل