Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0005210

Quasi-actions on trees: research announcement

Lee Mosher·Michah Sageev·Kevin Whyte
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For example, if Gamma is a graph of coarse PD(n) groups for a fixed n, if the Bass-Serre tree of Gamma has infinitely many ends, and if H is a finitely generated group quasi-isometric to pi_1(Gamma), then we prove that H is the fundamental group of a graph of coarse PD(n) groups, with vertex and edge groups quasi-isometric to those of Gamma. We also have quasi-isometric rigidity theorems for graphs of coarse PD groups of nonconstant dimension, under various assumptions on the edge-to-vertex group inclusions.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Lee Mosher, Michah Sageev, Kevin Whyte. 2000-05-22. Quasi-actions on trees: research announcement. https://arxiv.org/abs/math/0005210

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗