SearcharxivSearch

arXiv · 0909.0321

Reflection subgroups of finite and affine Weyl groups

Abstract

We discuss the classification of reflection subgroups of finite and affine Weyl groups from the point of view of their root systems. A short case free proof is given of the well known classification of the isomorphism classes of reflection subgroups using completed Dynkin diagrams, for which there seems to be no convenient source in the literature. This is used as a basis for treating the affine case, where finer classifications of reflection subgroups are given, and combinatorial aspects of root systems are shown to appear. Various parameter sets for certain types of subsets of roots are interpreted in terms of alcove geometry and the Tits cone, and combinatorial identities are derived.

Explore related subjects

Keep this discovery

BibTeXRIS

M. J. Dyer, G. I. Lehrer. 2009-09-02. Reflection subgroups of finite and affine Weyl groups. https://arxiv.org/abs/0909.0321

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