Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Orientation-Reversing Crystallographic Rigidity

Jack Esson, Eleftherios Kastis, Bernd Schulze

TL;DR

The work delivers a complete combinatorial framework for the forced symmetric rigidity of planar bar-joint frameworks with orientation-reversing symmetry $\Gamma=\mathbb{Z}^2\rtimes\mathcal{C}_s$ under a fixed lattice, establishing that a gain graph is minimally rigid iff it is $\mathbb{Z}^2\rtimes\mathcal{C}_s$-tight, i.e., $(2,1)$-tight with three sparsity-aware subconditions. It proves this via an inductive construction using gained $0$-, $1$-, and loop-$1$-extensions and a parallel reduction argument that reduces any tight graph to the base $K_1^1$, with careful handling of a 1-extension that creates a triple of parallel edges. The results not only fill a gap for orientation-reversing wallpaper groups but also extend directly to the subgroups $cm$ and $pg$, and they set the stage for future work on other wallpaper groups, flexible lattices, higher dimensions, and non-Euclidean settings. The approach integrates gain-graph sparsity, switching invariance, and orbit rigidity matrices to yield a robust, inductive characterization of forced symmetric rigidity in crystallographic frameworks.

Abstract

This paper provides a combinatorial characterisation for generic forced symmetric rigidity of bar-joint frameworks in the Euclidean plane that are symmetric with respect to the orientation-reversing wallpaper group $\mathbb{Z}^2\rtimes\mathcal{C}_s$, also known as $pm$ in crystallography, under a fixed lattice representation. Corresponding results for the wallpaper groups $cm$ and $pg$ follow directly from this. The method used also provides an inductive construction for the corresponding gain graphs, in terms of Henneberg-type graph operations.

Orientation-Reversing Crystallographic Rigidity

TL;DR

The work delivers a complete combinatorial framework for the forced symmetric rigidity of planar bar-joint frameworks with orientation-reversing symmetry under a fixed lattice, establishing that a gain graph is minimally rigid iff it is -tight, i.e., -tight with three sparsity-aware subconditions. It proves this via an inductive construction using gained -, -, and loop--extensions and a parallel reduction argument that reduces any tight graph to the base , with careful handling of a 1-extension that creates a triple of parallel edges. The results not only fill a gap for orientation-reversing wallpaper groups but also extend directly to the subgroups and , and they set the stage for future work on other wallpaper groups, flexible lattices, higher dimensions, and non-Euclidean settings. The approach integrates gain-graph sparsity, switching invariance, and orbit rigidity matrices to yield a robust, inductive characterization of forced symmetric rigidity in crystallographic frameworks.

Abstract

This paper provides a combinatorial characterisation for generic forced symmetric rigidity of bar-joint frameworks in the Euclidean plane that are symmetric with respect to the orientation-reversing wallpaper group , also known as in crystallography, under a fixed lattice representation. Corresponding results for the wallpaper groups and follow directly from this. The method used also provides an inductive construction for the corresponding gain graphs, in terms of Henneberg-type graph operations.

Paper Structure

This paper contains 13 sections, 34 theorems, 24 equations, 8 figures.

Table of Contents

  1. Introduction
  2. Symmetric frameworks
  3. The conditions for reflectional periodic rigidity
  4. Reflectional Periodic Symmetry: Extensions
  5. Reflectional Periodic Symmetry: Reductions
  6. Straightforward Reductions
  7. 1-reductions on Vertices with Two Neighbours
  8. 1-reductions on Vertices with Three Neighbours
  9. Further work
  10. Other wallpaper groups.
  11. Flexible lattice representations.
  12. Higher dimensions.
  13. Non-Euclidean spaces.

Key Result

Lemma 2.1

Let $(G,m)$ be a $\Gamma$-gain graph such that for every vertex $v$ of $G$, the gain space $\langle(G,m)\rangle_v$ is contained in $\Gamma'\leq \Gamma$. Then there is an equivalent gain graph $(G,m')$ in which every gain is an element of $\Gamma'$.

Figures (8)

  • Figure 4.1: The two variations of the $0$-extension.
  • Figure 4.2: The four variations of the $1$-extension.
  • Figure 4.3: The loop-$1$-extension. Note that the gain $m(l)$ must have a non-trivial $\mathcal{C}_s$-component.
  • Figure 5.1: A vertex $v_0$ of degree $3$ with two neighbours.
  • Figure 5.2: Illustration for the proof of Lemma \ref{['Degree3Neighbour2MatchLoop']}, showing the case where the balanced blockers $G_{12}$ and $G_{13}$ intersect in exactly $2$ vertices.
  • ...and 3 more figures

Theorems & Definitions (65)

  • Lemma 2.1
  • Definition 3.1
  • Theorem 3.2
  • Lemma 3.3
  • proof
  • Definition 4.1
  • Proposition 4.2
  • proof
  • Proposition 4.3
  • proof
  • ...and 55 more