{"title":"Constructing uncountably many groups with the same profinite completion","authors":"N. Nikolov, D. Segal","doi":"10.53733/89","DOIUrl":null,"url":null,"abstract":"\n\n\nTwo constructions are described: one gives soluble groups of derived length 4, the other uses groups acting on a rooted tree.\n\n\n","PeriodicalId":30137,"journal":{"name":"New Zealand Journal of Mathematics","volume":"41 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"New Zealand Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.53733/89","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2
Abstract
Two constructions are described: one gives soluble groups of derived length 4, the other uses groups acting on a rooted tree.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
