Search arXivSearch

arXiv · 2010.12720

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

Abstract

Let $(\mathcal{G},Γ)$ be an abstract graph of finite groups. If $Γ$ is finite, we can construct a profinite graph of groups in a natural way $(\hat{\mathcal{G}},Γ)$, where $\hat{\mathcal{G}}(m)$ is the profinite completion of $\mathcal{G}(m)$ for all $m \in Γ$. The main reason for this is that $Γ$ is finite, so it is already profinite. In this paper we deal with the infinite case, by constructing a profinite graph $\overlineΓ$ where $Γ$ is densely embedded and then defining a profinite graph of groups $(\widehat{\mathcal{G}},\overlineΓ)$. We also prove that the fundamental group $Π_1(\widehat{\mathcal{G}},\overlineΓ)$ is the profinite completion of $Π_1^{abs}(\mathcal{G},Γ)$. 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

Explore connections, maps & timelines

BibTeXRIS

Mattheus Aguiar, Pavel Zalesski. 2021-05-06. 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

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR