The Conjugacy Relation on One-sided Subshifts is Non-treeable
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.