Schreir graphs: Transitivity and coverings
Schreir graphs: Transitivity and coverings
复制标题
施赖尔图:传递性和覆盖
DOI:
10.1142/s021819671650003x
复制
发表时间:
2015
期刊:
影响因子:
--
通讯作者:
P. Leemann
中科院分区:
文献类型:
--
作者:
P. Leemann
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.