Tree amalgamations and quasi-isometries

IF 1.2 1区 数学 Q1 MATHEMATICS Journal of Combinatorial Theory Series B Pub Date : 2025-07-01 Epub Date: 2025-02-14 DOI:10.1016/j.jctb.2025.02.003
Matthias Hamann
{"title":"Tree amalgamations and quasi-isometries","authors":"Matthias Hamann","doi":"10.1016/j.jctb.2025.02.003","DOIUrl":null,"url":null,"abstract":"<div><div>We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the quasi-isometry type of their one-ended factors in any of their terminal factorisations. Our results carry over theorems of Papasoglu and Whyte on quasi-isometries between multi-ended groups to those between multi-ended graphs. In the end, we discuss the impact of our results to a question of Woess.</div></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"173 ","pages":"Pages 83-101"},"PeriodicalIF":1.2000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895625000103","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/14 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the quasi-isometry type of their one-ended factors in any of their terminal factorisations. Our results carry over theorems of Papasoglu and Whyte on quasi-isometries between multi-ended groups to those between multi-ended graphs. In the end, we discuss the impact of our results to a question of Woess.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
树合并和准等距
我们研究了树合并和拟等距之间的联系。特别地,我们证明了多端可达拟传递连通局部有限图的拟等距型是由其任意终端分解中的单端因子的拟等距型决定的。我们的结果将Papasoglu和Whyte关于多端群间拟等距的定理推广到多端图间的拟等距定理。最后,我们讨论了我们的结果对一个Woess问题的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.70
自引率
14.30%
发文量
99
审稿时长
6-12 weeks
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
The four-color Ramsey multiplicity of triangles Partition density, star arboricity, and sums of Laplacian eigenvalues of graphs A lower bound on the number of edges in DP-critical graphs Chords in longest cycles in 3-connected graphs The least balanced graphs and trees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1