2000 character limit reached
Polygonal Complexes and Graphs for Crystallographic Groups
Published 18 Oct 2013 in math.CO and math.MG | (1310.4905v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.