On the complexity of topological conjugacy of Toeplitz subshifts
classification
🧮 math.LO
math.DSmath.GR
keywords
conjugacysubshiftstoeplitzcomplexityequivalencenon-amenablerelationthen
read the original abstract
In this paper, we study the descriptive set theoretic complexity of the equivalence relation of conjugacy of Toeplitz subshifts of a residually finite group $G$. On the one hand, we show that if $G = \mathbb{Z}$, then topological conjugacy on Toeplitz subshifts with separated holes is amenable. In contrast, if $G$ is non-amenable, then conjugacy of Toeplitz $G$-subshifts is a non-amenable equivalence relation. The results were motivated by a general question, asked by Gao, Jackson and Seward, about the complexity of conjugacy for minimal, free subshifts of countable groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.