Search arXivSearch

arXiv · math/0204076

Amenability of groups acting on trees

Abstract

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation \[Δ= < b,t|[b,t^2]b^{-1},[[[b,t^{-1}],b],b]>.\] I show that it acts transitively on a 3-regular tree, and that $Γ=< b,b^{t^{-1}}$ stabilizes a vertex and acts by restriction on a binary rooted tree. $Γ$ is a "fractal group", generated by a 3-state automaton, and is a discrete analogue of the monodromy action of iterates of f(z)=z^2-1 on associated coverings of the Riemann sphere. $Δ$ shares many properties with the Thompson group $F$. The proof of the main result (amenability of $Δ$) is incomplete in the present form; please refer to the paper arxiv.org/math.GR/0305262, joint with Balint Virag, for a complete proof.

Explore related subjects

Keep this discovery

BibTeXRIS

Laurent Bartholdi. 2003-05-19. Amenability of groups acting on trees. https://arxiv.org/abs/math/0204076

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