2016
DOI: 10.1016/j.apal.2015.07.005
|View full text |Cite
|
Sign up to set email alerts
|

Borel structurability on the 2-shift of a countable group

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

4
45
0
1

Year Published

2016
2016
2023
2023

Publication Types

Select...
10

Relationship

3
7

Authors

Journals

citations
Cited by 36 publications
(50 citation statements)
references
References 13 publications
4
45
0
1
Order By: Relevance
“…Immediately after the first version of our paper appeared, using a measurable version of the Local Lemma, Bernhsteyn [5] proved that free Bernoulli subshift admitting an invariant probability measure exists for any countable group. He also noted that this result follows from a deep theorem of Seward and Tucker-Drob [26]. We can actually characterize those uniformly recurrent subgroups Z for which all the Z-proper actions admit invariant probability measures (Theorem 6).…”
Section: Introductionmentioning
confidence: 88%
“…Immediately after the first version of our paper appeared, using a measurable version of the Local Lemma, Bernhsteyn [5] proved that free Bernoulli subshift admitting an invariant probability measure exists for any countable group. He also noted that this result follows from a deep theorem of Seward and Tucker-Drob [26]. We can actually characterize those uniformly recurrent subgroups Z for which all the Z-proper actions admit invariant probability measures (Theorem 6).…”
Section: Introductionmentioning
confidence: 88%
“…Proof. By work of the author and Tucker-Drob (see [52] for free actions; the case of non-free actions is in preparation), there is a G-equivariant class-bijective Borel map φ :…”
Section: Preliminariesmentioning
confidence: 99%
“…is a G δ subset of 2 Γ , and so we can consider the restriction of the left shift action to it. By [11], for any a and X as in the previous paragraph, there is a Borel Γ-equivariant map X → F (2 Γ ). Therefore studying the graph G(a 0 , S), called the shift graph of Γ, can give us information about all of the graphs G(a, S).…”
Section: Introductionmentioning
confidence: 97%