






















We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not quasi-isometrically rigid. We also characterise its Gromov boundary as the set of straight foliations with no saddle connections. In our arguments, we give a generalisation of the unicorn paths in the arc graph which may be of independent interest.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。