Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1811.00913

An improved proof of the Almost Stability Theorem

Warren Dicks
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1989, Dicks and Dunwoody proved the Almost Stability Theorem, which has among its corollaries the Stallings-Swan theorem that groups of cohomological dimension one are free. In this article, we use a nestedness result of Bergman, Bowditch, and Dunwoody to simplify somewhat the proof of the finitely generable case of the Almost Stability Theorem. We also simplify the proof of the non finitely generable case. The proof we give here of the Almost Stability Theorem is essentially self contained, except that in the non finitely generable case we refer the reader to the original argument for the proofs of two technical lemmas about groups acting on trees.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Warren Dicks. 2018-11-02. An improved proof of the Almost Stability Theorem. https://arxiv.org/abs/1811.00913

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↗