2017
DOI: 10.4171/jfg/55
|View full text |Cite
|
Sign up to set email alerts
|

Ends of Schreier graphs and cut-points of limit spaces of self-similar groups

Abstract: Every self-similar group acts on the space X ω of infinite words over some alphabet X. We study the Schreier graphs Γ w for w ∈ X ω of the action of self-similar groups generated by bounded automata on the space X ω . Using sofic subshifts we determine the number of ends for every Schreier graph Γ w . Almost all Schreier graphs Γ w with respect to the uniform measure on X ω have one or two ends, and we characterize bounded automata whose Schreier graphs have two ends almost surely. The connection with (local) … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

1
13
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 23 publications
1
13
0
Order By: Relevance
“…In this case is a set of left cosets (for the left version of definition) and . Again, one can consider a right version of the definition, oriented or non-oriented, labeled or unlabeled versions of the Schreier graph [ 61 , 62 , 63 ].…”
Section: Graphs Of Algebraic Origin and Their Growthmentioning
confidence: 99%
See 1 more Smart Citation
“…In this case is a set of left cosets (for the left version of definition) and . Again, one can consider a right version of the definition, oriented or non-oriented, labeled or unlabeled versions of the Schreier graph [ 61 , 62 , 63 ].…”
Section: Graphs Of Algebraic Origin and Their Growthmentioning
confidence: 99%
“…A Schreier graph Γ = Γ(G, H, A) is determined by a triple (G, H, A), where as before A is a system of generators of G and H is a subgroup of G. In this case V = {gH | g ∈ G} is a set of left cosets (for the left version of definition) and E = {(gH, agH) | g ∈ G, a ∈ A ∪ A −1 }. Again, one can consider a right version of the definition, oriented or nonoriented, labeled or unlabeled versions of the Schreier graph [61][62][63].…”
Section: Graphs Of Algebraic Origin and Their Growthmentioning
confidence: 99%
“…Finite and infinite Schreier graphs have been investigated from a combinatorial point of view in several contexts (e.g., [10,13]). Classifications of infinite Schreier graphs have been studied in several papers (see [4,5,8,9,21] for further discussions about this topic). In this setting, another problem is of considerable interest: the study of the spectral properties of Schreier graphs associated with an automaton group.…”
Section: Introductionmentioning
confidence: 99%
“…Remark 4.17. Theorem 4.16 can be directly proven by using the techniques developed in [5]. Now we pass to the study of isomorphism classes for the infinite Schreier graphs…”
mentioning
confidence: 99%
“…It has proven to have deep connections with the theory of profinite groups and with complex dynamics. In particular, many groups of this type satisfy a property of self-similarity, reflected on fractalness of some limit objects associated with them [2,5,19]. In the spirit of the modern theory of dynamical systems, one is interested in the action of an automaton group (which is a countable group) on the uncountable set of right infinite sequences somehow endowed with the uniform measure.…”
Section: Introductionmentioning
confidence: 99%