SearcharxivSearch

arXiv · 2012.04088

Stable commutator length in right-angled Artin and Coxeter groups

Abstract

We establish a spectral gap for stable commutator length (scl) of integral chains in right-angled Artin groups (RAAGs). We show that this gap is not uniform, i.e. there are RAAGs and integral chains with scl arbitrarily close to zero. We determine the size of this gap up to a multiplicative constant in terms of the opposite path length of the defining graph. This result is in stark contrast with the known uniform gap 1/2 for elements in RAAGs. We prove an analogous result for right-angled Coxeter groups. In a second part of this paper we relate certain integral chains in RAAGs to the fractional stability number of graphs. This has several consequences: Firstly, we show that every rational number q>=1 arises as the stable commutator length of an integral chain in some RAAG. Secondly, we show that computing scl of elements and chains in RAAGs is NP hard. Finally, we heuristically relate the distribution of scl for random elements in the free group to the distribution of fractional stability number in random graphs. We prove all of our results in the general setting of graph products. In particular all above results hold verbatim for right-angled Coxeter groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Lvzhou Chen, Nicolaus Heuer. 2020-12-07. Stable commutator length in right-angled Artin and Coxeter groups. https://arxiv.org/abs/2012.04088

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