SearcharxivSearch

arXiv · math/0005181

On the asymptotic geometry of abelian-by-cyclic groups

Abstract

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if |det(M)|=1. We give a complete classification of the nonpolycyclic groups Gamma_M up to quasi-isometry: given n x n integer matrices M,N with |det(M)|, |det(N)| > 1, the groups Gamma_M, Gamma_N are quasi-isometric if and only if there exist positive integers r,s such that M^r, N^s have the same absolute Jordan form. We also prove quasi-isometric rigidity: if Gamma_M is an abelian-by-cyclic group determined by an n x n integer matrix M with |det(M)| > 1, and if G is any finitely generated group quasi-isometric to Gamma_M, then there is a finite normal subgroup K of G such that G/K is abstractly commensurable to Gamma_N, for some n x n integer matrix N with |det(N)| > 1.

Explore related subjects

Keep this discovery

BibTeXRIS

Benson Farb, Lee Mosher. 2000-05-17. On the asymptotic geometry of abelian-by-cyclic groups. https://arxiv.org/abs/math/0005181

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