Abstract
We use the theory of Borel equivalence relations to analyze the equivalence relation of isomorphism among one-dimensional subshifts. We show that this equivalence relation is a universal countable Borel equivalence relation, so that it admits no definable complete invariants fundamentally simpler than the equivalence classes. We also see that the classification of higher dimensional subshifts up to isomorphism has the same complexity as for the one-dimensional case.
Similar content being viewed by others
References
R. Dougherty, S. Jackson and A. S. Kechris, The structure of hyperfinite Borel equivalence relations, Transactions of the American Mathematical Society 341 (1994), 193–225.
S. Jackson, A. S. Kechris and A. Louveau, Countable Borel equivalence relations, Journal of Mathematical Logic 2 (2002), 1–80.
A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995.
D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, Cambridge, 1995.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Clemens, J.D. Isomorphism of subshifts is a universal countable borel equivalence relation. Isr. J. Math. 170, 113–123 (2009). https://doi.org/10.1007/s11856-009-0022-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-009-0022-0