Isomorphism of subshifts is a universal countable Borel equivalence relation

DOI10.1007/S11856-009-0022-0zbMATH Open1180.03043OpenAlexW2077516133MaRDI QIDQ839908FDOQ839908

John D. Clemens

Publication date: 3 September 2009

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-009-0022-0

Recommendations

• Isomorphism and weak conjugacy of free Bernoulli subflows
• Isomorphism and embedding of Borel systems on full sets
• Classifying Borel automorphisms
• On the complexity of the isomorphism relation for finitely generated groups
• The Structure of Hyperfinite Borel Equivalence Relations

zbMATH Keywords

subshiftBorel equivalence relationPolish space

Mathematics Subject Classification ID

Descriptive set theory (03E15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Cites Work

• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• The Structure of Hyperfinite Borel Equivalence Relations
• COUNTABLE BOREL EQUIVALENCE RELATIONS

Cited In (9)

• Topological isomorphism for rank-1 systems
• Group Colorings and Bernoulli Subflows
• Quotients by countable normal subgroups are hyperfinite
• Isomorphism and weak conjugacy of free Bernoulli subflows
• On the complexity of topological conjugacy of Toeplitz subshifts
• CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES
• The complexity of the topological conjugacy problem for Toeplitz subshifts
• Topological full groups of minimal subshifts and the classification problem for finitely generated complete groups
• The complexity of topological conjugacy of pointed Cantor minimal systems

This page was built for publication: Isomorphism of subshifts is a universal countable Borel equivalence relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839908)