The Conjugacy Relation on One-sided Subshifts is Non-treeable

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Ruiwen Li
DOI: 10.48550/arxiv.2603.04776
Cited by: 0
References: 5

Abstract

In this paper we study the conjugacy relation on one-sided subshifts in the viewpoint of descriptive set theory. We show the conjugacy relation on one sided subshifts with the alphabet set $\{0,1\}$ is non-treeable and non-amenable.

Fields of Study & Subjects

Advanced Topology and Set Theory Mathematical Dynamics and Fractals Computability Logic AI Algorithms

Publication details

Journal / source
arXiv (Cornell University)
Publication date
5 March 2026
Language
EN
Document type
Preprint