The Conjugacy Relation on One-sided Subshifts is Non-treeable
Logic
2026-03-06 v1
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 is non-treeable and non-amenable.
Cite
@article{arxiv.2603.04776,
title = {The Conjugacy Relation on One-sided Subshifts is Non-treeable},
author = {Ruiwen Li},
journal= {arXiv preprint arXiv:2603.04776},
year = {2026}
}