Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 150 tok/s
Gemini 2.5 Pro 50 tok/s Pro
GPT-5 Medium 31 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 105 tok/s Pro
Kimi K2 185 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

The complexity of the topological conjugacy problem for Toeplitz subshifts (1602.08179v2)

Published 26 Feb 2016 in math.LO and math.DS

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.