联系不紧密的群体

David Hume, J. M. Mackay
{"title":"联系不紧密的群体","authors":"David Hume, J. M. Mackay","doi":"10.1090/PROC/15128","DOIUrl":null,"url":null,"abstract":"We investigate groups whose Cayley graphs have poor\\-ly connected subgraphs. We prove that a finitely generated group has bounded separation in the sense of Benjamini--Schramm--Timar if and only if it is virtually free. We then prove a gap theorem for connectivity of finitely presented groups, and prove that there is no comparable theorem for all finitely generated groups. Finally, we formulate a connectivity version of the conjecture that every group of type $F$ with no Baumslag-Solitar subgroup is hyperbolic, and prove it for groups with at most quadratic Dehn function.","PeriodicalId":8427,"journal":{"name":"arXiv: Group Theory","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Poorly connected groups\",\"authors\":\"David Hume, J. M. Mackay\",\"doi\":\"10.1090/PROC/15128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate groups whose Cayley graphs have poor\\\\-ly connected subgraphs. We prove that a finitely generated group has bounded separation in the sense of Benjamini--Schramm--Timar if and only if it is virtually free. We then prove a gap theorem for connectivity of finitely presented groups, and prove that there is no comparable theorem for all finitely generated groups. Finally, we formulate a connectivity version of the conjecture that every group of type $F$ with no Baumslag-Solitar subgroup is hyperbolic, and prove it for groups with at most quadratic Dehn function.\",\"PeriodicalId\":8427,\"journal\":{\"name\":\"arXiv: Group Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Group Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/PROC/15128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Group Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/PROC/15128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

我们研究Cayley图有穷连通子图的群。我们证明了有限生成群在Benjamini- Schramm- Timar意义上具有有界分离当且仅当它是虚拟自由的。然后,我们证明了有限生成群的连通性的一个间隙定理,并证明了所有有限生成群没有可比较的定理。最后,我们给出了没有Baumslag-Solitar子群的每一类群都是双曲的猜想的连通性版本,并证明了不超过二次Dehn函数的群的连通性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Poorly connected groups
We investigate groups whose Cayley graphs have poor\-ly connected subgraphs. We prove that a finitely generated group has bounded separation in the sense of Benjamini--Schramm--Timar if and only if it is virtually free. We then prove a gap theorem for connectivity of finitely presented groups, and prove that there is no comparable theorem for all finitely generated groups. Finally, we formulate a connectivity version of the conjecture that every group of type $F$ with no Baumslag-Solitar subgroup is hyperbolic, and prove it for groups with at most quadratic Dehn function.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Galois descent of equivalences between blocks of 𝑝-nilpotent groups Onto extensions of free groups. Finite totally k-closed groups Shrinking braids and left distributive monoid Calculating Subgroups with GAP
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1