arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.04602math.GR
收藏

双曲群的Schreier图的端

Ends of Schreier graphs of hyperbolic groups

Audrey Vonseel

摘要:

研究了双曲群的Schreier图的端数。设G是双曲群,H是G的子群.一般来说,没有算法来计算对(G,H)的Schreier图的端点数。然而,假设H是G的拟凸子群,我们构造了一个算法。

英文摘要:

We study the number of ends of a Schreier graph of a hyperbolic group. Let G be a hyperbolic group and let H be a subgroup of G. In general, there is no algorithm to compute the number of ends of a Schreier graph of the pair (G, H). However, assuming that H is a quasi-convex subgroup of G, we construct an algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑