SearcharxivSearch

arXiv · 1503.03788

A combination theorem for affine tree-free groups

Abstract

Let $\Lambda_0$ be an ordered abelian group. We show how an $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ group -- that is, a group admitting a free affine action without inversions on a $\mathbb{Z}\times\Lambda_0$-tree -- admits a natural graph of groups decomposition, where vertex groups inherit actions on $\Lambda_0$-trees. Using recent work of various authors, it follows that a finitely generated group admitting a free affine action on a $\mathbb{Z}^n$-tree where no line has its orientation reversed is relatively hyperbolic with nilpotent parabolics, is locally quasiconvex, and has solvable word, conjugacy and isomorphism problems. Conversely, given a graph of groups satisfying certain conditions, we show how an affine action of its fundamental group can be constructed. Specialising to the case of free affine actions, we obtain a large class of $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ groups that do not act freely by isometries on any $\Lambda_1$-tree. We also give an example of a group that admits a free isometric action on a $\mathbb{Z}\times\mathbb{Z}$-tree but which is not residually nilpotent.

Explore related subjects

Keep this discovery

BibTeXRIS

Shane O Rourke. 2015-03-12. A combination theorem for affine tree-free groups. https://arxiv.org/abs/1503.03788

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