The complexity of the topological conjugacy problem for Toeplitz subshifts

DOI10.1007/s11856-017-1537-4zbMath1430.37019arXiv1602.08179OpenAlexW3102914765MaRDI QIDQ2408033

Burak Kaya

Publication date: 9 October 2017

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

Full work available at URL: https://arxiv.org/abs/1602.08179

zbMATH Keywords

topological conjugacyBorel complexityToeplitz subshift

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Multidimensional shifts of finite type (37B51)

Related Items

On the complexity of topological conjugacy of Toeplitz subshifts ⋮ CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological isomorphism for rank-1 systems
• Isomorphism of subshifts is a universal countable Borel equivalence relation
• Topics in orbit equivalence
• On the complexity of topological conjugacy of Toeplitz subshifts
• A Borel reductibility theory for classes of countable structures
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Toeplitz minimal flows which are not uniquely ergodic
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I
• The Structure of Hyperfinite Borel Equivalence Relations
• COUNTABLE BOREL EQUIVALENCE RELATIONS
• A criterion for Toeplitz flows to be topologically isomorphic and applications
• Liapunov stability and adding machines
• An Introduction to Symbolic Dynamics and Coding
• Group Colorings and Bernoulli Subflows
• The classification of hypersmooth Borel equivalence relations
• TOPOLOGICAL FULL GROUPS OF MINIMAL SUBSHIFTS AND JUST-INFINITE GROUPS