2017
DOI: 10.1007/s11856-017-1541-8
|View full text |Cite
|
Sign up to set email alerts
|

On the complexity of topological conjugacy of Toeplitz subshifts

Abstract: 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 = 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…The bireducibility type of the conjugacy relation of various classes of dynamical systems and group actions has been extensively studied. For many classes of topological or measurable dynamical systems, the conjugacy relations is known or conjectured to be quite complicated from the perspective of bireducibility [39,40,62,102]. As an example, the conjugacy relation of elements of Homeo 0 (R) is bireducible to the isomorphism relation of all countable (but not necessarily locally finite) graphs, which is analytic but not Borel (see [48,Theorem 4.9]), and the conjugacy of homeomorphisms of the plane is strictly more complicated by a result of Hjorth [48,Theorem 4.17].…”
Section: Topology Of the Space Of Equivalence Classes Of Preordersmentioning
confidence: 99%
“…The bireducibility type of the conjugacy relation of various classes of dynamical systems and group actions has been extensively studied. For many classes of topological or measurable dynamical systems, the conjugacy relations is known or conjectured to be quite complicated from the perspective of bireducibility [39,40,62,102]. As an example, the conjugacy relation of elements of Homeo 0 (R) is bireducible to the isomorphism relation of all countable (but not necessarily locally finite) graphs, which is analytic but not Borel (see [48,Theorem 4.9]), and the conjugacy of homeomorphisms of the plane is strictly more complicated by a result of Hjorth [48,Theorem 4.17].…”
Section: Topology Of the Space Of Equivalence Classes Of Preordersmentioning
confidence: 99%
“…A subshift X of n Γ is Toeplitz if it is the closure of the Γ-orbit of some Toeplitz function x ∈ n Γ . Toeplitz subshifts are always minimal [31] and, as explained in [44], the set ToepSubsh(n Γ ) of all free Toeplitz subshifts of n Γ is a Borel subset of FMSubsh(n Γ ). We let NAToepSubsh(n Z 2 ) denote the Borel subset of ToepSubsh(n Z 2 ) consisting of all free Toeplitz subshifts X ⊆ n Z 2 with the property that the topological full group [[Z 2 X]] is nonamenable (equivalently, the commutator subgroup [[Z 2 X]] ′ is nonamenable).…”
Section: Isomorphism On the Space Of Finitely Generated Simple Noname...mentioning
confidence: 99%
“…Conjugacy of odometers is smooth due to Buescu and Stewart [2]. The complexity of conjugacy of Toeplitz subshifts was treated several times—by Thomas, Sabok, and Tsankov, and by Kaya [13, 26, 28]. Conjugacy of two-sided subshifts is Borel bireducible to the universal countable Borel equivalence relation due to Clemens [6].…”
Section: Introductionmentioning
confidence: 99%