SearcharxivSearch

arXiv · 0911.0209

Groups acting freely on $\Lambda$-trees

Abstract

A group is called $\Lambda$-free if it has a free Lyndon length function in an ordered abelian group $\Lambda$, which is equivalent to having a free isometric action on a $\Lambda$-tree. A group has a regular free length function in $\Lambda$ if and only if it has a free isometric action on a $\Lambda$-tree so that all branch points belong to the orbit of the base point. In this paper we prove that every finitely presented $\Lambda$-free group $G$ can be embedded into a finitely presented group with a regular free length function in $\Lambda$ so that the length function on $G$ is preserved by the embedding. Next, we prove that every finitely presented group $\widetilde G$ with a regular free Lyndon length function in $\Lambda$ has a regular free Lyndon length function in ${\mathbb R}^n$ ordered lexicographically for an appropriate $n$ and can be obtained from a free group by a series of finitely many HNN-extensions in which associated subgroups are maximal abelian and length isomorphic.

Explore related subjects

Keep this discovery

BibTeXRIS

O. Kharlampovich, A. Myasnikov, D. Serbin. 2009-11-01. Groups acting freely on $\Lambda$-trees. https://arxiv.org/abs/0911.0209

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