no. 13 · Wednesday 11 November 2026
Subperiodic groups and bounded automorphisms of periodic graphs
Abstract
A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\mathbb R^d$ which contains a translation lattice $\mathbb Z^r$ of rank $r < d$ as a subgroup of finite index. Cayley graphs of subperiodic groups are used to illustrate the concept of bounded automorphisms (particularly of finite order), i.e. those when the distance between a graph vertex and its image has an upper bound. The description of subperiodic groups in dimension 3 in terms of subgroup structure and abstract group isomorphism types [75 crystallographic rod groups ($r=1$) and 80 layer groups ($r=2$) belong to 32 and 34 types, respectively] allows for a convenient characterization of bounded automorphisms of their Cayley graphs. An easy-to-compute set of invariants is developed for recognizing the isomorphism types of crystallographic groups in $\mathbb R^3$ from finite presentations which makes use of only the number of nonconjugate subgroups up to a given finite index $n$ ($n \leq 12$ for rod groups, $n \leq 8$ for layer groups, and $n \leq 24$ for space groups), and how many of them are normal. A criterion is proven that if a finite (inverse-closed) generating set of a group $G$ is stabilized by conjugation by a nontrivial element of finite order in $G$, then the respective Cayley graph possesses nontrivial bounded automorphisms of finite order. This criterion is applied to three-periodic sphere-packing graphs. Subperiodic groups in $\mathbb R^4$ with a three-dimensional translation lattice are used to systematically derive embeddings of three-periodic ladder graphs in $\mathbb R^3$.
- comments
- 24 pages, 10 figures, 7 tables; Section 3.3 (a bit) extended, Section 4.1 revised and extended, Appendix A corrected, Fig. 5 improved, references added
- fields
- Group Theory, Combinatorics