SearcharxivSearch

arXiv · 2307.10760

Length functions on groups and actions on graphs

Abstract

We study generalisations of Chiswell's Theorem that $0$-hyperbolic Lyndon length functions on groups always arise as based length functions of the the group acting isometrically on a tree. We produce counter-examples to show that this Theorem fails if one replaces $0$-hyperbolicity with $\delta$-hyperbolicity. We then propose a set of axioms for the length function on a finitely generated group that ensures the function is bi-Lipschitz equivalent to a (or any) length function of the group acting on its Cayley graph.

Explore related subjects

Keep this discovery

BibTeXRIS

Matthew Collins, Armando Martino. 2023-07-20. Length functions on groups and actions on graphs. https://arxiv.org/abs/2307.10760

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