Bastián Espinoza
Published 2020-08-31Version 1
In this article, we prove two results about minimal $\cS$-adic subshifts with finite alphabet rank: 1. they have finite topological rank, and 2. symbolic factors between systems of this kind are always almost constant-to-1. Both results are consequence of some rigidity properties of the underlying combinatorics of words in this class of subshifts. As a corollary of the first result, we answer a question of Donoso, Durand, Maass and Petite.
Comments: 19 pages, 1 figure
On symbolic factors of $\mathcal{S}$-adic subshifts of finite topological rank
On partial rigidity of $\mathcal{S}$-adic subshifts
On the automorphism group of minimal S-adic subshifts of finite alphabet rank
![QR code for arXiv:2008.13689 [math.DS]](http://oss.arxitics.com/images/favicon.svg)