SearcharxivSearch

arXiv · 1507.05744

Ping pong on CAT(0) cube complexes

Abstract

Let $G$ be a group acting properly and essentially on an irreducible, non-Euclidean finite dimensional CAT(0) cube complex $X$ without fixed points at infinity. We show that for any finite collection of simultaneously inessential subgroups $\{H_1, \ldots, H_k\}$ in $G$, there exists an element $g$ of infinite order such that $\forall i$, $\langle H_i, g\rangle \cong H_i * \langle g\rangle$. We apply this to show that any group, acting faithfully and geometrically on a non-Euclidean possibly reducible CAT(0) cube complex, has property $P_{naive}$ i.e. given any finite list $\{g_1, \ldots, g_k\}$ of elements from $G$, there exists $g$ of infinite order such that $\forall i$, $\langle g_i, g\rangle \cong \langle g_i \rangle *\langle g\rangle$. This applies in particular to the Burger-Moses simple groups that arise as lattices in products of trees. The arguments utilize the action of the group on its Poisson boundary and moreover, allow us to summarise equivalent conditions for the reduced $C^*$-algebra of the group to be simple.

Explore related subjects

Keep this discovery

BibTeXRIS

Aditi Kar, Michah Sageev. 2015-07-21. Ping pong on CAT(0) cube complexes. https://arxiv.org/abs/1507.05744

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