Overview
This study investigates the emergence of discrete symmetry groups, specifically wallpaper groups, from strategic interaction within tiled game structures. It establishes that all seventeen wallpaper groups act on covers generated by tiling the plane with copies of a bimatrix game's support complex, connected by controlled boundary rules.
Research Context
The core inquiry concerns which discrete symmetry groups can manifest through strategic interactions. This involves analyzing the geometrical and symmetrical properties that emerge when game theoretic structures are extended across a plane in a repeating pattern. The framework utilizes bimatrix games, specifically their support complexes, as the fundamental units for tiling. The symmetry properties are then analyzed in the context of wallpaper groups, which are the 17 types of discrete, two-dimensional crystallographic groups that describe repeating patterns in a plane.
Approach
The methodology involves constructing covers by tiling the plane with copies of a bimatrix game's support complex. These copies are joined by controlled boundary rules. The resulting structures were then analyzed for the presence and type of wallpaper groups.
- Generator Identification: Explicit generators for the identified wallpaper groups were determined.
- Verification: These generators were subject to machine verification as graph automorphisms.
- Certification: Each realization of a wallpaper group was certified as an exact toroidal quotient.
- Type Identification: A crystallographic recognizer, operating in exact rational arithmetic, was used to identify the types of symmetry groups.
- Validation: The identifications were cross-validated using GAP (Groups, Algorithms, Programming – a system for computational discrete algebra).
A three-line lemma was developed to transform the classical distinction between symmorphic and non-symmorphic groups into a lattice classification. This lemma relates the existence of realizations whose translations contain the full tile lattice to the thirteen symmorphic groups. For the four non-symmorphic groups, realizations were found where the translation-lattice index was exactly two, which is described as the minimum possible, with the tile representing the glide's half-step.
Computational Tracks
The construction was accompanied by two computational tracks:
- Graph Track: This track demonstrated that quotienting a straight cover by its translations recovers the tile exactly, denoted as $\beq(M/\calT)=\beq(K)$. It also indicated that swap boundaries add $\binom m2$, independently of payoffs and cover size.
- Game Track: This track focused on game-theoretic aspects. Detecting a duplicated-strategy cover is a linear-time payoff scan. A single tile solution folds to a full translation orbit of cover equilibria. The tiled correlated-equilibrium system exhibits a dimension of exactly $r(d-q)+q$, with expansion being impossible.
Findings
- All seventeen wallpaper groups were observed to act on the covers constructed from tiled bimatrix game support complexes.
- Explicit, machine-verified graph automorphism generators were identified for each wallpaper group.
- Every realization was certified as an exact toroidal quotient.
- Symmorphic groups (thirteen of them) correspond to realizations where translations contain the full tile lattice.
- Non-symmorphic groups (four of them) correspond to realizations where the translation-lattice index is exactly two, with the tile forming the glide's half-step.
- The polymatrix cover carries the symmetry directly, meaning every wallpaper action, including glides, constitutes a group of genuine game automorphisms.
- Equilibria collapse along any symmetry subgroup to a folded fixed-point problem.
- A decorated refinement of the system possesses a game automorphism group that is exactly the toroidal wallpaper group.
Why This Matters
This research provides a foundational understanding of how fundamental symmetries, as categorized by wallpaper groups, can naturally arise within structured strategic interactions. The detailed verification and computational analysis offer a rigorous establishment of this connection.