Constructing uncountably many groups with the same profinite completion
Nikolay Nikolov, Dan Segal

TL;DR
This paper constructs two uncountable families of finitely generated residually finite groups, one soluble and one branch, all sharing the same profinite completion, highlighting the diversity of groups with identical profinite properties.
Contribution
It introduces the first known uncountable families of finitely generated residually finite groups with identical profinite completions, including soluble and branch groups.
Findings
Uncountably many groups share the same profinite completion.
Construction of families includes soluble and branch groups.
Demonstrates diversity in groups with identical profinite properties.
Abstract
We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.
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
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · semigroups and automata theory
