SearcharxivSearch

arXiv · 1205.0271

Detecting ends of residually finite groups in profinite completions

Abstract

Let $\C$ be a variety of finite groups. We use profinite Bass--Serre theory to show that if $u:H\hookrightarrow G$ is a map of finitely generated residually $\C$ groups such that the induced map $\hat{u}:\hat{H}\rightarrow\hat{G}$ is a surjection of the pro-$\C$ completions, and $G$ has more than one end, then $H$ has the same number of ends as $G$. However if $G$ has one end the number of ends of $H$ may be larger; we observe cases where this occurs for $\C$ the class of finite $p$-groups. We produce a monomorphism of groups $u:H\hookrightarrow G$ such that: either $G$ is hyperbolic but not residually finite; or $\hat{u}:\hat{H}\rightarrow\hat{G}$ is an isomorphism of profinite completions but $H$ has property (T) (and hence (FA)), but $G$ has neither. Either possibility would give new examples of pathological finitely generated groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Owen Cotton-Barratt. 2012-05-01. Detecting ends of residually finite groups in profinite completions. https://doi.org/10.1017/s0305004113000418

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