Constructing uncountably many groups with the same profinite completion

Two constructions are described: one gives soluble groups of derived length 4, the other uses groups acting on a rooted tree.

書誌詳細
主要な著者: Nikolov, N, Segal, D
フォーマット: Internet publication
言語:English
出版事項: New Zealand Mathematical Society 2021