SearcharxivSearch

arXiv · math/0405237

Quasi-actions on trees II: Finite depth Bass-Serre trees

Abstract

This paper addresses questions of quasi-isometric rigidity and classification for fundamental groups of finite graphs of groups, under the assumption that the Bass-Serre tree of the graph of groups has finite depth. The main example of a finite depth graph of groups is one whose vertex and edge groups are coarse Poincare duality groups. The main theorem says that, under certain hypotheses, if G is a finite graph of coarse Poincare duality groups then any finitely generated group quasi-isometric to the fundamental group of G is also the fundamental group of a finite graph of coarse Poincare duality groups, and any quasi-isometry between two such groups must coarsely preserves the vertex and edge spaces of their Bass-Serre trees of spaces. Besides some simple normalization hypotheses, the main hypothesis is the ``crossing graph condition'', which is imposed on each vertex group G_v which is an n-dimensional coarse Poincare duality group for which every incident edge group has positive codimension: the crossing graph of G_v is a graph e_v that describes the pattern in which the codimension~1 edge groups incident to G_v are crossed by other edge groups incident to G_v, and the crossing graph condition requires that e_v be connected or empty.

Explore related subjects

Keep this discovery

BibTeXRIS

Lee Mosher, Michah Sageev, Kevin Whyte. 2005-09-16. Quasi-actions on trees II: Finite depth Bass-Serre trees. https://arxiv.org/abs/math/0405237

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