Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complex Reflection Groups

Updated 25 November 2025
  • Complex Reflection Groups are finite subgroups of GL(V) generated by reflections that fix hyperplanes in an n-dimensional complex space.
  • They are classified by Shephard–Todd into infinite families and exceptional cases, with structures that reveal intricate combinatorial and invariant properties.
  • These groups underpin various applications in algebraic geometry, braid group theory, and mathematical physics through their connections to invariant theory and combinatorial models.

A complex reflection group is a finite subgroup GGL(V)G \subset GL(V) of an nn-dimensional complex vector space VV, generated by elements (reflections) each fixing a hyperplane pointwise and acting with a single nontrivial eigenvalue. These groups generalize real (Coxeter) reflection groups and exhibit rich algebraic, combinatorial, geometric, and topological structures. They were classified by Shephard and Todd into infinite families and exceptional cases, initiating deep connections to invariant theory, braid groups, algebraic combinatorics, and mathematical physics.

1. Classification and Structure

The classification of irreducible complex reflection groups is due to Shephard–Todd. Every such group is either an imprimitive group of the form G(m,p,n)G(m,p,n) (where m,n1m, n \geq 1, pmp \mid m), or one of 34 exceptional groups G4,,G37G_4, \dots, G_{37} (Etingof et al., 2010). The group G(m,p,n)G(m,p,n) consists of n×nn \times n monomial matrices with entries mth roots of unity and determinant an (m/p)(m/p)th root of unity. Special cases recover real finite reflection groups: nn0, nn1 is the hyperoctahedral group (nn2), and nn3 is the even-signed group (nn4) (Burnham-Schmidt et al., 4 Oct 2025).

Complex reflection groups admit a matrix or wreath-product realization, and their structure supports two distinct classes of reflections:

  • Transposition-like: Order two, e.g., nn5 swaps nn6, nn7 and multiplies by roots of unity.
  • Diagonal: Scalar diagonal matrices fixing a hyperplane, with order dividing nn8 (Lewis et al., 2021).

2. Invariant and Coinvariant Theory

For any complex reflection group nn9, Chevalley–Shephard–Todd proved that the invariant algebra VV0 is a polynomial algebra generated by VV1 homogeneous invariants of degrees VV2 (Reiner et al., 2016, Briggs, 2017). The coinvariant algebra VV3 with VV4 is a complete intersection of codimension VV5. The spectrum of VV6 and codimension data underpins much of the algebraic and combinatorial structure (Briggs, 2017).

Well-generated ("duality") groups—those generated by VV7 reflections—are characterized by a degree-codegree duality: VV8 for all VV9, where G(m,p,n)G(m,p,n)0 are the codegrees. These include G(m,p,n)G(m,p,n)1 for all G(m,p,n)G(m,p,n)2, G(m,p,n)G(m,p,n)3, and certain exceptional G(m,p,n)G(m,p,n)4 (Briggs, 2017).

3. Reflection Length, Orders, and Posets

Define the reflection length G(m,p,n)G(m,p,n)5 of G(m,p,n)G(m,p,n)6 as the minimal number of reflections whose product is G(m,p,n)G(m,p,n)7, and codimension G(m,p,n)G(m,p,n)8. While G(m,p,n)G(m,p,n)9 always, equality m,n1m, n \geq 10 throughout m,n1m, n \geq 11 only occurs for Coxeter groups and m,n1m, n \geq 12 (Foster-Greenwood, 2012). In m,n1m, n \geq 13 (with m,n1m, n \geq 14 or in exceptional types), there exist elements with m,n1m, n \geq 15, due to m,n1m, n \geq 16-connected diagonal elements which are nonreflection atoms of the codimension poset (Foster-Greenwood, 2012). This discrepancy controls the necessity of higher-degree generators in the Hochschild cohomology of skew group algebras.

Both reflection length and codimension induce partial orders on m,n1m, n \geq 17, studied using character-theoretic and algebraic techniques (Foster-Greenwood, 2012).

4. Hurwitz Action, Reflection Factorizations, and Quasi-Coxeter Elements

Reflection factorizations and their Hurwitz orbits encode deep combinatorial and group-theoretic information. For m,n1m, n \geq 18, the Hurwitz action of the braid group m,n1m, n \geq 19 on pmp \mid m0-tuples pmp \mid m1 of reflections (preserving the product) relates all shortest reflection factorizations. The number of Hurwitz orbits and transitivity criteria are given via explicit formulas involving invariant-theoretic data (cycle partitions, gcd of weights) (Lewis et al., 2021).

An element pmp \mid m2 is quasi-Coxeter if it has a minimal-length reflection factorization generating pmp \mid m3; such elements are precisely characterized by conditions on cycle-weights and their generation of pmp \mid m4 and pmp \mid m5 (Lewis et al., 2021). The Hurwitz action is transitive on shortest factorizations of quasi-Coxeter elements.

5. Arrangements, Braid Groups, and Crystallographic Extensions

The arrangement pmp \mid m6 of reflecting hyperplanes under pmp \mid m7 gives rise to a complex hyperplane complement pmp \mid m8, fundamental group pmp \mid m9 ("pure braid group"), and orbit complement G4,,G37G_4, \dots, G_{37}0 ("generalized braid group"). Short exact sequences encode the relationship between these groups and G4,,G37G_4, \dots, G_{37}1 (Marin, 2015).

Quotients G4,,G37G_4, \dots, G_{37}2 yield crystallographic groups acting on tori of rank equal to the number of hyperplanes, with holonomy group G4,,G37G_4, \dots, G_{37}3. For G4,,G37G_4, \dots, G_{37}4-subgroups, the corresponding Bieberbach groups are torsion-free, giving rise to flat manifolds with holonomy relating directly to the group-theoretic structure of G4,,G37G_4, \dots, G_{37}5 (Marin, 2015).

Crystallographic complex reflection groups G4,,G37G_4, \dots, G_{37}6 (with G4,,G37G_4, \dots, G_{37}7 finite and G4,,G37G_4, \dots, G_{37}8 a G4,,G37G_4, \dots, G_{37}9-invariant full rank lattice) generalize affine Weyl groups. Steinberg's theorem for regular orbits being off all mirrors typically holds, with exceptions isolated to a handful of low-dimensional cases (Puente et al., 2018).

6. Combinatorics and Homological Aspects

Complex reflection groups underpin geometric and combinatorial objects such as noncrossing partitions, parking functions, and pinnacle sets. In the well-generated setting, the numbers of noncrossing partitions and parking functions are given by rational Catalan numbers and generalizations: G(m,p,n)G(m,p,n)0 where G(m,p,n)G(m,p,n)1 is the Coxeter number. Algebraic and combinatorial models of parking spaces are equivariantly isomorphic, and these correspondences extend to Fuss-Catalan cases (Miller, 2023, Stack, 4 Feb 2025).

Invariant differential derivations, homology in the order complexes arising from reflection arrangements, and the representation-theoretic realization of top homology as ribbon modules or Specht modules are universal phenomena in the well-generated setting (Miller, 2011, Reiner et al., 2016, Briggs, 2017).

7. Applications and Further Directions

Complex reflection groups have profound consequences in algebraic geometry (orbit spaces, cohomology rings, Kähler flat manifolds), mathematical physics (e.g., elliptic Calogero–Moser Hamiltonians, Dunkl operators), combinatorics (noncrossing objects, parking functions), invariant theory, and representation theory (Etingof et al., 2010, Briggs, 2017, Stack, 4 Feb 2025). The study of normal reflection subgroups, braid group actions, and their cohomological invariants remains active (Arreche et al., 2020). The precise topological, geometric, and representation-theoretic properties of the exceptional groups and their generalizations continue to drive research at the interface of combinatorics, geometry, and algebra.


References

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Complex Reflection Groups.