Subperiodic groups and bounded automorphisms of periodic graphs
summary
The gist
Subperiodic groups and bounded automorphisms of periodic graphs classifies subperiodic groups in dimension 3 and develops a more abstract view motivated by applications to vertex-transitive periodic…
In short
The paper classifies subperiodic groups in 3D and introduces a new view using bounded automorphisms of finite order for vertex-transitive periodic graphs. It establishes criteria linking graph symmetries to group structures, providing tools for constructing piecewise-linear embeddings of periodic graphs in R3.
Key concepts
- Subperiodic Groups
- These groups are viewed as quotients of space groups in 3D with respect to maximal normal translation subgroups having a rank less than the dimension. The paper classifies these into abstract isomorphism classes using specific invariants related to subgroup counts.
- Bounded Automorphisms
- These are automorphisms of a graph where the distance between any vertex and its image is limited by an upper bound. They are studied in relation to Cayley graphs of space groups, specifically those with finite order elements.
- Cayley Graph Automorphisms
- The paper investigates when a generating set $S$ for a Cayley graph is stabilized by conjugation by an element of finite order. This condition is equivalent to the graph possessing nontrivial bounded automorphisms of finite order, providing a group-theoretic test for these symmetries.
- Piecewise-Linear Embedding
- This method involves constructing a suitable representation of a periodic graph in R3. It uses the symmetry group to find compatible coordinates by lifting the graph to R4 and then projecting back to R3 by restricting symmetry operators.
Terminology used across episodes
This episode discusses
- Subperiodic groups and bounded automorphisms of periodic graphs · Paper Radio
- An Orbifold Framework for Classifying Layer Groups with an Application to Knitted Fabrics
The paper
Subperiodic groups and bounded automorphisms of periodic graphs · Read on arXiv
A subperiodic group is a group of motions of d-dimensional Euclidean space R d which contains a translation lattice 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 R cubed from finite presentations which makes use of only the number of nonconjugate subgroups up to a given finite index n (n at most 12 for rod groups, n at most 8 for layer groups, and n at most 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 R 4 with a three-dimensional translation lattice are used to systematically derive embeddings of three-periodic ladder graphs in R cubed.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Subperiodic groups and bounded automorphisms of periodic graphs".
Emmy: Here's the gist of the paper. Subperiodic groups and bounded automorphisms of periodic graphs classifies subperiodic groups in dimension 3 and develops a more abstract view motivated by applications to vertex-transitive periodic graphs, specifically bounded automorphisms of finite order Classification of Subperiodic Groups The paper addresses the classification of subperiodic groups in R3 into abstract group isomorphism classes, noting that 75 crystallographic rod groups (r = 1) and 80 layer groups (r = 2) are shown to belong to 32 and 34 isomorphism classes, respectively Subperiodic groups can be viewed as quotient groups of space groups in R d with respect to maximal normal translation subgroups of rank r < d The classification involves invariants such as the number of subgroups up to a given finite index n and how many of them are normal Automorphisms and Boundedness The paper develops a more abstract view of subperiodic groups motivated by application to automorphisms of vertex-transitive periodic graphs, specifically bounded automorphisms of finite order Bounded automorphisms are defined as those when the distance between a graph vertex and its image has an upper bound For Cayley graphs of a crystallographic space group G, bounded automorphisms of finite order exist if and only if the respective inverse-closed generating set is stabilized by conjugation by an element of finite order in G Group-Theoretic Criteria for Automorphisms The paper establishes several propositions concerning Cayley graph automorphisms, including Proposition 4 which states that for a Cayley graph of a space group G with respect to the generating set S = S−1, there exists an element g ∈ G, g ≠ 1 of finite order such that S = g−1Sg This existence is equivalent to the graph having nontrivial bounded automorphisms of finite order Theorem 1 provides a necessary and sufficient criterion when Aut(Γ) is a space group for a very broad class of vertex-transitive periodic graphs which are Cayley graphs of space groups Applications in Graph Embeddings The theory has practical implications for constructing Cayley graphs of space groups which a priori possess bounded automorphisms of finite order The paper describes a method to obtain a suitable piecewise-linear embedding of a periodic graph in R d by first computing its symmetry group and then finding compatible coordinates This approach involves lifting the graph to R4 and projecting back to R3 by restricting symmetry operators Analysis of Specific Graph Types The analysis includes examples of 1-periodic graphs, such as zigzag carbon nanotubes, where vertex stabilizers are stabilized only by bounded automorphisms of finite order For 2-periodic graphs, ladder graphs are simple examples with automorphism groups isomorphic to a layer group The paper also presents computational methods using GAP to compute the stabilizer in G from a sufficiently large finite quotient G/T Table 4 lists sphere-packing graphs with bounded automorphisms of finite order, showing that almost half of the graphs have uncountable automorphism groups The results suggest that the stabilizer of the generating set has order 2 in all considered cases Construction Methods for Ladder Graphs A practical algorithm is suggested for finding piecewise-linear vertex-transitive embeddings of three-periodic ladder graphs in R3 by lifting them to a hyperplane in R4 and projecting back to R3 The resulting subgroups of Aut(Λ) are then computed as subperiodic groups in R4 and projected back to R3, yielding space groups for vertex-transitive embeddings of Λ in R3 This method allows for the reproduction of known ladder graphs and the derivation of new ones The coset G(Λ)/StabG(Λ)(Γ) must not contain mirror reflections because otherwise edge intersections are enforced in the embedding Invariants for Classification Every group is characterized by a ‘fingerprint’ that is an ordered list of 2-tuples
(m1, n1), … (mk, nk): where (mk, nk) refers to the number mk of conjugacy classes of subgroups of index k + 1 and the number nk of normal subgroups Experiment suggests that the maximal index to be considered is 12 for rod groups and 8 for layer groups These invariants allow to distinguish groups within a given finite set The importance of considering normal subgroups is clarified by examples comparing wallpaper groups cm and p2gg based on the number of conjugacy classes of subgroups up to index 11 Group-Theoretic Connections There exists a deep connection between the structure of a graph and the subgroup structure of its automorphism group, where the asymptotic behaviour of the growth function determines this connection Theorem 3 states that if G is a finitely generated group with polynomial growth, then it contains a nilpotent subgroup of finite index Theorem 4 states that for a vertex-transitive graph with polynomial growth, there exists a partition σ of V (Γ) into finite blocks xσ such that the group Aut(Γ/σ) is finitely generated and contains a nilpotent subgroup of finite index Theorem 5 uncovers the only ‘mechanism’ for graphs of polynomial growth to have uncountable Aut(Γ): it is the possibility to permute vertices inside blocks xσ independently Theorem 5 also states that under certain assumptions, Bo(Γ) ∈ CAut(Γ)(T(G)) and hence Bo(Γ) ∈ CAut(Γ)(G) If Aut(Γ): G is finite, then Aut(Γ) is virtually abelian and B(Γ) is the FC-center of Aut(Γ) The examples in Table 4 show that the stabilizer of the generating set has order 2, and therefore the orbits of (some subgroup of) Bo(Γ) are always two-element blocks In most cases, the stabilizer is contained in the generating set The qualitative speaking suggests this stabilizer is an ‘echo’ of centralizing elements in Aut(Γ) which always correspond to bounded automorphisms References
1: Baburin, I.
Ada: A., On the group-theoretical approach to the study of interpenetrating nets
4: Bandura, A.
Emmy: V.
Ada: and Evarestov, R.
Paper summary: Ada: So, looking at the paper "Subperiodic groups and bounded automorphisms of periodic graphs," it seems the main achievement is classifying subperiodic groups in R three-dimensional space into concrete isomorphism classes for rod and layer groups using invariants based on subgroups up to a certain index.
Emmy: And beyond that classification, they successfully developed this more abstract framework by linking subperiodic groups to bounded automorphisms of finite order on vertex-transitive periodic graphs. It’s about using those automorphism properties as a way to look at the underlying group structure in a new light.
Kolya: What this means for the world is that it provides tools for understanding symmetry in physical systems, like those found in solid-state physics nanostructures, where the symmetry groups are often these types of periodic graphs.
Ada: Exactly. It shows that even when dealing with complex geometric symmetries, you can use group theory to find concrete structural properties about how those symmetries act on the graph itself.
Emmy: It bridges the gap between pure group classification and applied problems in geometry and physics by showing how bounded automorphisms give us a way to analyze these systems structurally.
Conclusion: Ada: So, to wrap up this paper on "Subperiodic groups and bounded automorphisms of periodic graphs," the authors are basically taking these complicated symmetry groups from three dimensional space and sorting them into clear families based on how they act on specific types of graphs.
Emmy: They're looking at rod groups, which are one-dimensional periodic structures, and layer groups, which are two-dimensional ones, and showing that they fit neatly into thirty-two and thirty-four isomorphism classes respectively.
Kolya: The core idea is using these bounded automorphisms of finite order—those symmetries where a vertex doesn't move too far from where it started—to get a more abstract way to classify the whole group structure.
Ada: It moves the focus from just looking at the raw symmetry group to understanding how those symmetries constrain the underlying geometry of the graph itself.
Emmy: It suggests that this approach can be applied broadly, not just to these specific periodic graphs, but to any vertex-transitive periodic graph where you care about those bounded symmetries.
Kolya: The practical implication is a method for constructing physical models—specifically Cayley graphs of space groups—that have these predictable symmetry properties right from the start.
Ada: It gives us a systematic way to build these complex structures, starting from the required symmetry and working toward the actual geometric embedding in three dimensional space.
Emmy: This whole idea connects abstract group theory directly to how we visualize and construct physical objects with repeating patterns.
Kolya: And it opens up new avenues for studying those systems where you have high symmetry but want to understand their specific limitations or constraints on motion.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors