SearcharxivSearch

arXiv · 1605.01651

Subgroup dynamics and $C^\ast$-simplicity of groups of homeomorphisms

Abstract

We study the uniformly recurrent subgroups of groups acting by homeomorphisms on a topological space. We prove a general result relating uniformly recurrent subgroups to rigid stabilizers of the action, and deduce a $C^*$-simplicity criterion based on the non-amenability of rigid stabilizers. As an application, we show that Thompson's group $V$ is $C^\ast$-simple, as well as groups of piecewise projective homeomorphisms of the real line. This provides examples of finitely presented $C^\ast$-simple groups without free subgroups. We prove that a branch group is either amenable or $C^\ast$-simple. We also prove the converse of a result of Haagerup and Olesen: if Thompson's group $F$ is non-amenable, then Thompson's group $T$ must be $C^\ast$-simple. Our results further provide sufficient conditions on a group of homeomorphisms under which uniformly recurrent subgroups can be completely classified. This applies to Thompson's groups $F$, $T$ and $V$, for which we also deduce rigidity results for their minimal actions on compact spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Adrien Le Boudec, Nicolás Matte Bon. 2016-05-05. Subgroup dynamics and $C^\ast$-simplicity of groups of homeomorphisms. https://arxiv.org/abs/1605.01651

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