SearcharxivSearch

arXiv · 2504.18108

Translation length formula for two-generated groups acting on trees

Abstract

We investigate translation length functions for two-generated groups acting by isometries on $\Lambda$-trees, where $\Lambda$ is a totally ordered abelian group. In this context, we provide an explicit formula for the translation length of any element of the group, under certain assumptions on the translation lengths of its generators and their products. Our approach is purely combinatorial and uses only the defining axioms of pseudo-lengths. As shown by Parry, pseudo-lengths coincide with the translation length functions for actions on $\Lambda$-trees. Furthermore, we prove that, under certain conditions on four elements $\alpha, \beta, \gamma, \delta \in \Lambda$, there exists a unique pseudo-length on the free group $F(a,b)$ assigning these values to $a$, $b$, $ab$, $ab^{-1}$, respectively. Applications include results on properly discontinuous actions and discrete free groups of isometries. We also develop an algorithmic approach to studying translation length functions arising from free actions on $\mathbb{R}$-trees. Based on this, we state a conjecture that would lead to a description of $\mathrm{Aut}{(F_2)}$-orbits in the Culler-Vogtmann outer space.

Explore related subjects

Keep this discovery

BibTeXRIS

Kamil Orzechowski. 2025-04-25. Translation length formula for two-generated groups acting on trees. https://arxiv.org/abs/2504.18108

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