SearcharxivSearch

arXiv · 2607.05466

The lattice of normal reflection subgroups of an irreducible reflection group

Abstract

The reflection subgroups of a reflection group have a natural lattice structure given by the reflections that they contain. By considering the conjugation action orbits of the reflection subgroups for a given root line, we are able to give an essentially combinatorial way to calculate the lattice of all the normal reflection subgroups of a given (finite irreducible) reflection group, and natural generators for them. Moreover, we observe that every complex reflection group is a normal subgroup of the unique maximal reflection group which shares its collineation group. Hence, we are able to present the Shephard-Todd classification of the complex reflection groups as a collection of maximal reflection groups, together with appropriate (collineation preserving) normal reflection subgroups. We investigate the quotients by the normal reflection subgroups, which are known to be reflection groups. We also consider the action of the collineation group on some appropriate small systems of lines, and how these results extend to quaternionic reflection groups. Some novel techniques are introduced, including the notion of a "hidden reflection", a combinatorial-geometric description of the reflection subgroups and the size of their conjugacy class, and the role played by the abelianisation of the reflection group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shayne Waldron. 2026-07-06. The lattice of normal reflection subgroups of an irreducible reflection group. https://arxiv.org/abs/2607.05466

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR