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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.