2014
DOI: 10.1007/978-1-4939-0781-6_16
|View full text |Cite
|
Sign up to set email alerts
|

Polygonal Complexes and Graphs for Crystallographic Groups

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.MSC2010: 52B10, 52B15

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 31 publications
0
4
0
Order By: Relevance
“…Here we generalise Ringel's approach in two directions. If we do not insist that each symbol appears exactly twice, we may use such schemes to describe the combinatorial structure of more general polygonal complexes in the sense of Schulte et al [53,54,55,72]. On the other hand, if we allow symbols with a single appearance, we may describe chemical structures, such as benzenoids as graphs embedded in a surface with a boundary.…”
Section: Methodsmentioning
confidence: 99%
“…Here we generalise Ringel's approach in two directions. If we do not insist that each symbol appears exactly twice, we may use such schemes to describe the combinatorial structure of more general polygonal complexes in the sense of Schulte et al [53,54,55,72]. On the other hand, if we allow symbols with a single appearance, we may describe chemical structures, such as benzenoids as graphs embedded in a surface with a boundary.…”
Section: Methodsmentioning
confidence: 99%
“…Here we generalise Ringel's approach in two directions. If we do not insist that each symbol appears exactly twice, we may use such schemes to describe the combinatorial structure of more general polygonal complexes in the sense of Schulte et al [56][57][58]75] On the other hand, if we allow symbols with a single appearance, we may describe chemical structures, such as benzenoids as graphs embedded in a surface with a boundary.…”
Section: Methodsmentioning
confidence: 99%
“…[28] Example 1. A typical example of a polygonal complex in the sense of Schulte et al [56][57][58]75] is a 2-dimensional skeleton of the tesseract (the 4-dimensional cube, see Figure 1). This skeleton is composed of 16 vertices, 32 edges and 24 quadrilateral faces.…”
Section: Methodsmentioning
confidence: 99%
“…In [8] 14 semiregular periodic nets are identified which also have the (sphere packing) property that there are no intervertex distances less than the common edge length (in a maximum-symmetry embedding). See also the detailed discussion in Pellicer and Schulte [19] and Schulte [25].…”
Section: Regular Discrete Netsmentioning
confidence: 99%