Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 172 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Stallings' Group is Simply Connected at Infinity (2506.19195v1)

Published 23 Jun 2025 in math.GR

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$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.