SearcharxivSearch

arXiv · 1411.0651

Semistability and Simple Connectivity at Infinity of Finitely Generated Groups with a Finite Series of Commensurated Subgroups

Abstract

A subgroup $H$ of a group $G$ is $commensurated$ in $G$ if for each $g\in G$, $gHg^{-1}\cap H$ has finite index in both $H$ and $gHg^{-1}$. If there is a sequence of subgroups $H=Q_0\prec Q_1\prec ...\prec Q_{k}\prec Q_{k+1}=G$ where $Q_i$ is commensurated in $Q_{i+1}$ for all $i$, then $Q_0$ is $subcommensurated$ in $G$. In this paper we introduce the notion of the simple connectivity at infinity of a finitely generated group (in analogy with that for finitely presented groups). Our main result is: If a finitely generated group $G$ contains an infinite, finitely generated, subcommensurated subgroup $H$, of infinite index in $G$, then $G$ is 1-ended and semistable at $\infty$. If additionally, $H$ is finitely presented and 1-ended, then $G$ is simply connected at $\infty$. A normal subgroup of a group is commensurated, so this result is a strict generalization of a number of results, including the main theorems of G. Conner and M. Mihalik \cite{CM}, B. Jackson \cite{J}, V. M. Lew \cite{L}, M. Mihalik \cite{M1}and \cite{M2}, and J. Profio \cite{P}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Mihalik. 2014-11-03. Semistability and Simple Connectivity at Infinity of Finitely Generated Groups with a Finite Series of Commensurated Subgroups. https://doi.org/10.2140/agt.2016.16.3615

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