SearcharxivSearch

arXiv · 0803.3010

Coxeter covers of the classical Coxeter groups

Abstract

Let $C(T)$ be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either $B_n$ or $D_n$. Let $C_Y(T)$ be a natural quotient of $C(T)$, and if $C(T)$ is simply-laced (which means all the relations between the generators has order 2 or 3), $C_Y(T)$ is a generalized Coxeter group, too . Let $A_{t,n}$ be a group which contains $t$ Abelian groups generated by $n$ elements. The main result in this paper is that $C_Y(T)$ is isomorphic to $A_{t,n} \semidirect B_n$ or $A_{t,n} \semidirect D_n$, depends on whether the signed graph $T$ contains loops or not, or in other words C(T) is simply-laced or not, and $t$ is the number of the cycles in $T$. This result extends the results of Rowen, Teicher and Vishne to generalized Coxeter groups which have a natural map onto one of the classical Coxeter groups.

Explore related subjects

Keep this discovery

BibTeXRIS

M. Amram, R. Shwartz, M. Teicher. 2008-03-20. Coxeter covers of the classical Coxeter groups. https://arxiv.org/abs/0803.3010

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