SearcharxivSearch

arXiv · 2010.12720

The profinite completion of the fundamental group of infinite graphs of groups

Abstract

Let $(\mathcal{G},\Gamma)$ be an abstract graph of finite groups. If $\Gamma$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},\Gamma)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of $\mathcal{G}(m)$ for all $m \in \Gamma$. The main reason for this is that $\Gamma$ is finite, so it is already profinite. In this paper we deal with the infinite case, by constructing a profinite graph $\overline{\Gamma}$ where $\Gamma$ is densely embedded and then defining a profinite graph of groups $(\widehat{\mathcal{G}},\overline{\Gamma})$. We also prove that the fundamental group $\Pi_1(\widehat{\mathcal{G}},\overline{\Gamma})$ is the profinite completion of $\Pi_1^{abs}(\mathcal{G},\Gamma)$. This answers Open Question 6.7.1 of the book Profinite Graphs and Groups, published by Luis Ribes in 2017. Later we generalise the main theorem of a paper by Luis Ribes and the second author, proving that if $R$ is a virtually free abstract group and $H$ is a finitely generated subgroup of $R$, then $\overline{N_{R}(H)}=N_{\hat{R}}(\overline{H})$ answering Open Question 15.11.10 of the book of Ribes. Finally, we generalise the main theorem of a paper by Sheila Chagas and the second author, showing that every virtually free group is subgroup conjugacy separable. This answers Open Question 15.11.11 of the same book of Ribes.

Explore related subjects

Keep this discovery

BibTeXRIS

Mattheus Aguiar, Pavel Zalesski. 2020-10-24. The profinite completion of the fundamental group of infinite graphs of groups. https://arxiv.org/abs/2010.12720

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