Open AccessConstructing uncountably many groups with the same profinite completion
Author(s) -
Nikolay Nikolov,
David R. Segal
Publication year - 2021
Publication title -
new zealand journal of mathematics
Language(s) - English
Resource type - Journals
eISSN - 1179-4984
pISSN - 1171-6096
DOI - 10.53733/89
Subject(s) - profinite group , tree (set theory) , mathematics , group (periodic table) , combinatorics , arithmetic , computer science , physics , quantum mechanics
Two constructions are described: one gives soluble groups of derived length 4, the other uses groups acting on a rooted tree.