{"title":"Embedding groups into boundedly acyclic groups","authors":"Fan Wu, Xiaolei Wu, Mengfei Zhao, Zixiang Zhou","doi":"10.1112/jlms.70164","DOIUrl":null,"url":null,"abstract":"<p>We show that the <span></span><math>\n <semantics>\n <mi>ϕ</mi>\n <annotation>$\\phi$</annotation>\n </semantics></math>-labeled Thompson groups and the twisted Brin–Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type <span></span><math>\n <semantics>\n <msub>\n <mi>F</mi>\n <mi>n</mi>\n </msub>\n <annotation>$F_n$</annotation>\n </semantics></math> embeds quasi-isometrically into a boundedly acyclic group of type <span></span><math>\n <semantics>\n <msub>\n <mi>F</mi>\n <mi>n</mi>\n </msub>\n <annotation>$F_n$</annotation>\n </semantics></math> that has no proper finite index subgroups. This improves a result of Bridson and a theorem of Fournier-Facio–Löh–Moraschini. Second, every group of type <span></span><math>\n <semantics>\n <msub>\n <mi>F</mi>\n <mi>n</mi>\n </msub>\n <annotation>$F_n$</annotation>\n </semantics></math> embeds quasi-isometrically into a 5-uniformly perfect group of type <span></span><math>\n <semantics>\n <msub>\n <mi>F</mi>\n <mi>n</mi>\n </msub>\n <annotation>$F_n$</annotation>\n </semantics></math>. Third, using Belk–Zaremsky's construction of twisted Brin–Thompson groups, we show that every finitely generated group embeds quasi-isometrically into a finitely generated boundedly acyclic simple group. We also partially answer some questions of Brothier and Tanushevski regarding the finiteness property of <span></span><math>\n <semantics>\n <mi>ϕ</mi>\n <annotation>$\\phi$</annotation>\n </semantics></math>-labeled Thompson group <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>V</mi>\n <mi>ϕ</mi>\n </msub>\n <mrow>\n <mo>(</mo>\n <mi>G</mi>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation>$V_\\phi (G)$</annotation>\n </semantics></math> and <span></span><math>\n <semantics>\n <mrow>\n <msub>\n <mi>F</mi>\n <mi>ϕ</mi>\n </msub>\n <mrow>\n <mo>(</mo>\n <mi>G</mi>\n <mo>)</mo>\n </mrow>\n </mrow>\n <annotation>$F_\\phi (G)$</annotation>\n </semantics></math>.</p>","PeriodicalId":49989,"journal":{"name":"Journal of the London Mathematical Society-Second Series","volume":"111 5","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2025-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the London Mathematical Society-Second Series","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1112/jlms.70164","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We show that the -labeled Thompson groups and the twisted Brin–Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type embeds quasi-isometrically into a boundedly acyclic group of type that has no proper finite index subgroups. This improves a result of Bridson and a theorem of Fournier-Facio–Löh–Moraschini. Second, every group of type embeds quasi-isometrically into a 5-uniformly perfect group of type . Third, using Belk–Zaremsky's construction of twisted Brin–Thompson groups, we show that every finitely generated group embeds quasi-isometrically into a finitely generated boundedly acyclic simple group. We also partially answer some questions of Brothier and Tanushevski regarding the finiteness property of -labeled Thompson group and .
期刊介绍:
The Journal of the London Mathematical Society has been publishing leading research in a broad range of mathematical subject areas since 1926. The Journal welcomes papers on subjects of general interest that represent a significant advance in mathematical knowledge, as well as submissions that are deemed to stimulate new interest and research activity.