Schreir graphs: Transitivity and coverings

Paul Henry Leemann

doi:10.1142/S021819671650003X

Schreir graphs: Transitivity and coverings

Paul Henry Leemann^*

^*Corresponding author for this work

University of Geneva

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	69-93
Number of pages	25
Journal	International Journal of Algebra and Computation
Volume	26
Issue number	1
DOIs	https://doi.org/10.1142/S021819671650003X
Publication status	Published - 1 Feb 2016
Externally published	Yes

Keywords

Graphs
coverings
vertex-transitivity

Access to Document

10.1142/S021819671650003X

Cite this

@article{6f325bf498dc432889a42f7123dbe0e5,

title = "Schreir graphs: Transitivity and coverings",

abstract = "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.",

keywords = "Graphs, coverings, vertex-transitivity",

author = "Leemann, {Paul Henry}",

note = "Publisher Copyright: {\textcopyright} World Scientific Publishing Company.",

year = "2016",

month = feb,

day = "1",

doi = "10.1142/S021819671650003X",

language = "English",

volume = "26",

pages = "69--93",

journal = "International Journal of Algebra and Computation",

issn = "0218-1967",

number = "1",

}

TY - JOUR

T1 - Schreir graphs

T2 - Transitivity and coverings

AU - Leemann, Paul Henry

N1 - Publisher Copyright: © World Scientific Publishing Company.

PY - 2016/2/1

Y1 - 2016/2/1

N2 - 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.

AB - 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.

KW - Graphs

KW - coverings

KW - vertex-transitivity

UR - http://www.scopus.com/inward/record.url?scp=84959248461&partnerID=8YFLogxK

U2 - 10.1142/S021819671650003X

DO - 10.1142/S021819671650003X

M3 - Article

AN - SCOPUS:84959248461

SN - 0218-1967

VL - 26

SP - 69

EP - 93

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

IS - 1

ER -

Schreir graphs: Transitivity and coverings

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this