The profinite completion of the fundamental group of infinite graphs of groups
Mattheus Aguiar, Pavel Zalesski

TL;DR
This paper extends the theory of profinite completions to infinite graphs of groups, establishing a new framework for understanding their fundamental groups and answering several open questions in the field.
Contribution
It constructs a profinite graph of groups for infinite graphs and proves the fundamental group is the profinite completion of the original, solving key open problems in profinite group theory.
Findings
Constructed a profinite graph embedding infinite graphs densely.
Proved the fundamental group of the profinite graph is the profinite completion.
Generalized results on subgroup conjugacy separability for virtually free groups.
Abstract
Let be an abstract graph of finite groups. If is finite, we can construct a profinite graph of groups in a natural way , where is the profinite completion of for all . 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 where is densely embedded and then defining a profinite graph of groups . We also prove that the fundamental group is the profinite completion of . 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Finite Group Theory Research
