The Conjugacy Relation on One-sided Subshifts is Non-treeable
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910041713410048 |
|---|---|
| author | Li, Ruiwen |
| author_facet | Li, Ruiwen |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_04776 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Conjugacy Relation on One-sided Subshifts is Non-treeable Li, Ruiwen Logic 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. |
| title | The Conjugacy Relation on One-sided Subshifts is Non-treeable |
| topic | Logic |
| url | https://arxiv.org/abs/2603.04776 |