Search arXivSearch

arXiv · 0805.2403

Local recognition of reflection graphs on Coxeter groups

Abstract

We provide local recognition results for the reflection graphs on spherical Coxeter groups. In particular, we study the case $F_4$ which is locally recognizable under additional constraints only. It is then demonstrated in the cases $A_n$ and $F_4$ how these graph theoretical recognition results can be used to characterize the corresponding Coxeter groups in terms of their reflection centralizers. Finally, we outline the connection to the local recognition of Chevalley groups which is particularly important in the classification of the finite simple groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Armin Straub. 2008-05-14. Local recognition of reflection graphs on Coxeter groups. https://arxiv.org/abs/0805.2403

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