Right-Angled Reflection Groups
- Right-Angled Reflection Groups are abstract groups defined by involutive reflections across polyhedral facets or CAT(0) cube complex faces with right-angle intersections.
- Their structure is characterized using an involution graph, which summarizes commutation relations and enables recognition via clique graph axioms.
- RACGs exhibit strong geometric rigidity and distinctive subgroup and automorphism properties, informing classifications in geometric and combinatorial group theory.
A right-angled reflection group is an abstract group generated by reflections across the facets of a polyhedron or, more generally, across the codimension-one faces in a CAT(0) cube complex, with the property that every pair of reflecting hyperplanes either meets orthogonally (so the corresponding reflections commute) or does not meet at all (so the corresponding reflections do not commute). This notion coincides with that of a right-angled Coxeter group (RACG): for a finite simple graph Γ = (V,E), the right-angled reflection group W_Γ is given by the presentation
These groups act as discrete reflection groups on nonpositively curved polyhedral complexes, and form a central class in geometric and combinatorial group theory (Cunningham et al., 2014, Jankiewicz et al., 2017, Qing, 2019).
1. Algebraic and Geometric Foundations
A right-angled reflection group (RACG) is defined purely in terms of a commutation graph: each vertex corresponds to an involutive generator, and two generators commute if and only if their corresponding facets meet at a right angle. Geometrically, the canonical realization involves the group generated by reflections in the facets of a right-angled polytope—such as a cube or higher-degree analogue—whose Coxeter diagram is Γ, with dihedral angles all equal to π/2 (Cunningham et al., 2014, Jankiewicz et al., 2017). In the context of CAT(0) cube complexes, these reflections act via isometries that fix hyperplanes orthogonally arranged according to Γ.
For any finite graph Γ, the Davis complex associated to W_Γ is a CAT(0) cube complex whose d-cubes correspond to d-cliques in Γ. The group W_Γ acts properly, cocompactly, and by isometries on this complex, with its generators realizing geometric reflections (Jankiewicz et al., 2017).
2. The Involution Graph and Clique Graph Characterization
A central algebraic invariant for right-angled reflection groups is the involution graph Δ(G), whose vertices are conjugacy classes of involutions (elements of order 2) in G and whose edges correspond to commuting representatives. For a RACG W_Γ, Δ(W_Γ) is finite and can be identified combinatorially with the clique graph Γ_K of Γ: its vertices are nonempty cliques in Γ, with edges whenever the union of two cliques forms a larger clique (Cunningham et al., 2014).
Cunningham–Eisenberg–Piggott–Ruane characterized when a finite graph Λ is isomorphic to the clique graph of some Γ, providing three necessary and sufficient conditions on the set of maximal cliques {Λ₁,...,Λ_r} of Λ:
| Condition | Description |
|---|---|
| Maximal clique condition | For every nonempty I⊆{1,…,r}, the intersection ΛI=⋂{i∈I}Λ_i has cardinality 2{k_I}−1 for some integer k_I≥1 |
| Minimal vertex condition | Each nonempty Λ_I contains at least one vertex v_I not lying in any strictly larger intersection Λ_J⊂Λ_I |
| Inclusion–exclusion cond. | For each J, ∑_{I⊋J}(−1){ |
Moreover, when these are satisfied, a specific algorithm ("collapsing algorithm") will recover Γ uniquely up to isomorphism from Λ (Cunningham et al., 2014).
3. Recognition Algorithms and Rigidity
Given a finitely presented group G, all of whose elements of finite order are involutions and with abelianization Gab≅(ℤ/2)n, there exists an explicit algorithm to determine whether G is a right-angled reflection group, based on the construction and analysis of its involution graph, checking the clique-graph axioms, and identifying a presentation isomorphic to some W_Γ. This process also provides a mechanism to produce candidate RACG presentations or certify nonexistence (Cunningham et al., 2014).
Isomorphism classes of RACGs are rigid: two RACGs W_Γ≅W_{Γ'} are isomorphic if and only if their defining graphs Γ, Γ′ are isomorphic. The proof relies on the fact that the involution graph Δ(W_Γ) completely determines Γ via the clique graph construction and associated characterization theorem (Cunningham et al., 2014).
4. Geometric Realizations and Virtual Algebraic Properties
Right-angled reflection groups can be realized geometrically as reflection groups in hyperbolic or Euclidean spaces, corresponding to right-angled polytopes with Γ as the dual skeleton. Notably, the right-angled reflection groups associated to the 24-cell and 120-cell in dimension 4 are generated by reflections in the facets of these polytopes, with presentations as RACGs over the edge graphs of the dual polytopes (Jankiewicz et al., 2017).
Such groups act properly and cocompactly on CAT(0) cube complexes (Davis complexes). For these and many right-angled reflection groups in low dimensions, properties such as "virtual algebraic fibering" can be established via Bestvina–Brady Morse theory, supplemented by combinatorial constructs called "legal systems." For instance, the 24-cell and 120-cell reflection groups admit finite-index torsion-free subgroups that fit into short exact sequences with finitely generated kernel over ℤ, establishing that they virtually fiber (Jankiewicz et al., 2017). In contrast, certain 3-manifold Coxeter groups lack such legal systems, implying failures of virtual fibering in those cases.
5. Automorphisms, Subgroup Structure, and Extensions
The automorphism group Aut(W_Γ) admits a canonical decomposition: Aut(W_Γ) = Aut⁰(W_Γ)⋊Aut¹(W_Γ), with Aut⁰ generated by partial-conjugation automorphisms. For graphs Γ with no separating intersection of links (SILs), Out⁰(W_Γ) is an elementary abelian 2-group, and Aut⁰(W_Γ) itself becomes a right-angled reflection group. This structure determines which extensions and automorphism subgroups preserve the RACG property; for example, extensions by disjoint partial conjugations yield RACGs, while infinite dihedral factors can produce forbidden configurations (Cunningham et al., 2014).
Subgroups generated by involutions in a RACG are not necessarily RACGs themselves. Specific "triangle-of-triangles" configurations in the involution graph can violate the necessary clique graph axioms, marking a sharp boundary in subgroup structure (Cunningham et al., 2014).
6. Geometric Rigidity and Comparison with Right-Angled Artin Groups
Right-angled reflection groups are subject to strong geometric rigidity constraints not present in their right-angled Artin group (RAAG) analogues. When acting geometrically on CAT(0) cubical spaces, the axes of reflection for RACGs are forced to intersect at right angles. For example, in Croke–Kleiner spaces—constructed as 2-dimensional cubical covers of Salvetti complexes—an RACG can act only if all intersection angles between reflecting axes are π/2, whereas the analogous RAAG admits a continuum of geometric actions with intersection angles in (0, π/2] (Qing, 2019). This rigidity of angle distinguishes RACGs from RAAGs even when the groups are quasi-isometric, establishing new geometric invariants and informing classifications up to quasi-isometry.
7. Classification Tools and Research Directions
The involution graph serves as a complete invariant for classifying right-angled reflection groups among involution-generated groups. The dictionary it establishes links combinatorial group data directly to geometric reflection structures. Ongoing research includes characterizing subgroup extensions that preserve the RACG property, developing outer space analogues for W_Γ, and understanding when involution graphs of subgroups can be directly deduced from those of the ambient group. Questions remain regarding the uniqueness of geometric actions in each quasi-isometry class and the classification of non-right-angled geometric realizations within and beyond the RACG framework (Cunningham et al., 2014, Jankiewicz et al., 2017, Qing, 2019).