
Polish groupoids and functorial complexity. Zur harmonischen Analyse klassenkompakter Gruppen.Īn introduction to symbolic dynamics and coding.Ĭambridge University Press, Cambridge, 1995. Sous-décalages de Toeplitz sur les groupes moyennables Topics in orbit equivalence, volume 1852 of Lecture Notes Kechris, and A. Louveau.Ĭantor systems, piecewise translations and simple amenable groups.Ĭlassical descriptive set theory, volume 156 of GraduateĪlexander S. Rigidity theorems for actions of product groups and countable Borel Non-treeability for product group actions. Memoirs of the American Mathematical Society. In Algebraic and topological dynamics, volume 385 of Contemp. The Choquet simplex of invariant measures for minimal flows. T. Downarowicz, J. Kwiatkowski, and Y. Lacroix.Ī criterion for Toeplitz flows to be topologically isomorphic and The structure of hyperfinite Borel equivalence relations. Invariant measures and orbit equivalence for generalized Toeplitz G-odometers and their almost one-to-one extensions. Isomorphism of subshifts is a universal countable Borel equivalenceĪlain Connes, Jacob Feldman, and Benjamin Weiss.Īn amenable equivalence relation is generated by a singleĮrgodic Theory Dynamical Systems, 1(4):431–450 (1982), 1981.
#Toeplitz subshift orbit equivalence how to#
However, it is notĬlear how to conclude anything from that about theĮquivalence relation E in particular, we do not know Not embed the groupoid of the free part of any BernoulliĪction of an infinite property (T) group. Results, it is easy to prove that Γ does For example, using Popa’s cocycle superrigidity Α 0 gives some restrictions on the groupoid We finally observe that the existence of the cocycle Its arrows as the other information can be recovered from We will sometimes identify a groupoid with the set of Will denote by A ( x, y ) the set of arrows between x and Such that P n ( x ) enumerate s − 1 ( x ) and Q n ( x )Įnumerate r − 1 ( x ) for every x. Of Borel maps P n : X → A and Q n : X → A The Lusin–Novikov selection theorem, there exist sequences
