SearcharxivSearch

arXiv · 2506.19195

Stallings' Group is Simply Connected at Infinity

Abstract

Let $F_2$ be the free group on two generators and let $B_n$ ($n \geq 2$) denote the kernel of the homomorphism $$F_2 \times \cdots (n) \cdots \times F_2 \rightarrow {\mathbb Z}$$ sending all generators to the generator $1$ of $\mathbb Z$. The groups $B_k$ are called the {\it Bieri-Stallings} groups and $B_k$ is type $\mathcal F_{k-1}$ but not $\mathcal F_k$. For $n\geq 3$ there are short exact sequences of the form $$1 \rightarrow B_{n-1} \rightarrow B_n \rightarrow F_2 \rightarrow 1.$$ This exact sequence can be used to show that $B_n$ is $(n-3)$-connected at infinity for $n\geq 3$. Stallings' proved that $B_2$ is finitely generated but not finitely presented. We conjecture that for $n\geq 2$, $B_n$ is $(n-2)$-connected at infinity. For $n=2$, this means that $B_2$ is 1-ended and for $n=3$ that $B_3$ (typically called Stallings' group) is simply connected at infinity. We verify the conjecture for $n=2$ and $n=3$. Our main result is the case $n=3$: Stalling's group is simply connected at $\infty$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Mihalik. 2025-06-23. Stallings' Group is Simply Connected at Infinity. https://arxiv.org/abs/2506.19195

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