Search arXivSearch

arXiv · math/0703439

Visual Decompositions of Coxeter Groups

Abstract

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions of a Coxeter group having special factors and special amalgamated subgroup are easily recognized from the presentation of the Coxeter group. If a Coxeter group is a subgroup of the fundamental group of a given graph of groups, then the Coxeter group is also the fundamental group of a graph of special subgroups, where each vertex and edge group is a subgroup of a conjugate of a vertex or edge group of the given graph of groups. A vertex group of an arbitrary graph of groups decomposition of a Coxeter group is shown to split into parts conjugate to special groups and parts that are subgroups of edge groups of the given decomposition. Several applications of the main theorem are produced, including the classification of maximal FA-subgroups of a finitely generated Coxeter group as all conjugates of certain special subgroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael L. Mihalik, Steven Tschantz. 2007-03-14. Visual Decompositions of Coxeter Groups. https://arxiv.org/abs/math/0703439

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