Schreir graphs: Transitivity and coverings

Schreir graphs: Transitivity and coverings
复制标题

施赖尔图:传递性和覆盖

DOI:
10.1142/s021819671650003x
复制
发表时间:
2015
期刊:
Int. J. Algebra Comput.
影响因子:
--
通讯作者:
P. Leemann
P. Leemann
中科院分区:
--
文献类型:
--
作者:
P. Leemann

文献摘要

被引文献

相似文献

给出了Schreier图之间的群、子群和生成系统的同构刻画。这种表征可以看作是双曲流形的Mostow刚性定理的图类比。这允许我们给出施赖尔图的传递性判据。最后,我们证明了塔斯基怪物满足一个强简单性准则。这部分地回答了Benjamini和dumini - copin的问题。
We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow’s rigidity theorem for hyperbolic manifolds. This allows us to give a transitivity criterion for Schreier graphs. Finally, we show that Tarski monsters satisfy a strong simplicity criterion. This gives a partial answer to a question of Benjamini and Duminil-Copin.