SearcharxivSearch

arXiv · 1312.3437

On the growth of a Coxeter group

Abstract

For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq a_n^{(W',S')}$ for all $n\in \mathbb{N}_0$, where $\preceq$ is a suitable partial order on Coxeter systems (cf. Thm. A). It is proven that there exists a constant $\tau= 1.13\dots$ such that for any non-affine, non-spherical Coxeter system $(W,S)$ the growth rate $\omega(W,S)=\limsup \sqrt[n]{a_n}$ satisfies $\omega(W,S)\geq \tau$ (cf. Thm. B). The constant $\tau$ is a Perron number of degree $127$ over $\mathbb{Q}$. For a Coxeter group $W$ the Coxeter generating set is not unique (up to $W$-conjugacy), but there is a standard procedure, the diagram twisting (cf. [BMMN02]), which allows one to pass from one Coxeter generating set $S$ to another Coxeter generating set $\mu(S)$. A generalisation of the diagram twisting is introduced, the mutation, and it is proven that Poincar\'e series are invariant under mutations (cf. Thm. C).

Explore related subjects

Keep this discovery

BibTeXRIS

T. Terragni. 2013-12-12. On the growth of a Coxeter group. https://doi.org/10.4171/ggd/358

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