The Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts

@inproceedings{Kaya2016TheCO,
  title={The Complexity of the Topological Conjugacy Problem for Toeplitz Subshifts},
  author={Burak Kaya},
  year={2016}
}
In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This result provides a partial answer to a question asked by Sabok and Tsankov. 

From This Paper

Topics from this paper.
1 Citations
17 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Group colorings and Bernoulli subflows

  • Su Gao, Steve Jackson, Brandon Seward
  • Mem. Amer. Math. Soc
  • 2015

On the complexity of topological conjugacy of Toeplitz subshifts, arXiv preprint arXiv:1506.07671v1 [math.LO

  • Marcin Sabok, Todor Tsankov
  • 2015

Isomorphism of subshifts is a universal countable Borel equivalence relation, Israel

  • John D. Clemens
  • J. Math
  • 2009

Pure and Applied Mathematics (Boca Raton)

  • Su Gao, Invariant descriptive set theory
  • vol. 293, CRC Press, Boca Raton, FL,
  • 2009
1 Excerpt

Survey of odometers and Toeplitz flows, Algebraic and topological dynamics

  • Tomasz Downarowicz
  • Contemp. Math.,
  • 2005

vol

  • Alexander S. Kechris, Benjamin D. Miller, Topics in orbit equivalence, Lecture Notes in Mathematics
  • 1852, Springer-Verlag, Berlin,
  • 2004

Similar Papers

Loading similar papers…