Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2301.13570 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911967660212224 |
|---|---|
| author | Bleak, Collin Olukoya, Feyishayo |
| author_facet | Bleak, Collin Olukoya, Feyishayo |
| contents | We address the following open problem, implicit in the 1990 article "Automorphisms of one-sided subshifts of finite type" of Boyle, Franks and Kitchens (BFK):
"Does there exists an element $ψ$ in the group of automorphisms of the one-sided shift $\operatorname{Aut}(\{0,1,\ldots,n-1\}^{\mathbb{N}}, σ_{n})$ so that all points of $\{0,1,\ldots,n-1\}^{\mathbb{N}}$ have orbits of length $n$ under $ψ$ and $ψ$ is not conjugate to a permutation?"
Here, by a 'permutation' we mean an automorphism of one-sided shift dynamical system induced by a permutation of the symbol set $\{0,1,\ldots,n-1\}$.
We resolve this question by showing that any $ψ$ with properties as above must be conjugate to a permutation.
Our techniques naturally extend those of BFK using the strongly synchronizing automata technology developed here and in several articles of the authors and collaborators (although, this article has been written to be largely self-contained). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_13570 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Conjugacy for certain automorphisms of the one-sided shift via transducers Bleak, Collin Olukoya, Feyishayo Group Theory Formal Languages and Automata Theory Dynamical Systems 54H15, 28D15, 22F50, 68Q99 We address the following open problem, implicit in the 1990 article "Automorphisms of one-sided subshifts of finite type" of Boyle, Franks and Kitchens (BFK): "Does there exists an element $ψ$ in the group of automorphisms of the one-sided shift $\operatorname{Aut}(\{0,1,\ldots,n-1\}^{\mathbb{N}}, σ_{n})$ so that all points of $\{0,1,\ldots,n-1\}^{\mathbb{N}}$ have orbits of length $n$ under $ψ$ and $ψ$ is not conjugate to a permutation?" Here, by a 'permutation' we mean an automorphism of one-sided shift dynamical system induced by a permutation of the symbol set $\{0,1,\ldots,n-1\}$. We resolve this question by showing that any $ψ$ with properties as above must be conjugate to a permutation. Our techniques naturally extend those of BFK using the strongly synchronizing automata technology developed here and in several articles of the authors and collaborators (although, this article has been written to be largely self-contained). |
| title | Conjugacy for certain automorphisms of the one-sided shift via transducers |
| topic | Group Theory Formal Languages and Automata Theory Dynamical Systems 54H15, 28D15, 22F50, 68Q99 |
| url | https://arxiv.org/abs/2301.13570 |