SearcharxivSearch

arXiv · 1202.6467

Amenable, transitive and faithful actions of groups acting on trees

Abstract

We study under which condition an amalgamated free product or an HNN-extension over a finite subgroup admits an amenable, transitive and faithful action on an infinite countable set. We show that such an action exists if the initial groups admit an amenable and almost free action with infinite orbits (e.g. virtually free groups or infinite amenable groups). Our result relies on the Baire category Theorem. We extend the result to groups acting on trees.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Fima. 2012-02-29. Amenable, transitive and faithful actions of groups acting on trees. https://arxiv.org/abs/1202.6467

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