paper

Symbolic factors of -adic subshifts of finite alphabet rank

arXiv:2008.13689 · doi:10.1017/etds.2022.21

Abstract

This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of -adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of -adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers of factor maps between minimal -adic subshifts of finite alphabet rank and show that they have the same finite cardinality for all in a residual subset of . Finally, we prove that the number of symbolic factors (up to conjugacy) of a fixed subshift of finite topological rank is finite, thus extending Durand's similar theorem on linearly recurrent subshifts [D00].

34 pages, 1 figure. Published now in Ergodic Theory and Dynamical Systems

References in corpus (1)

Cited by in corpus (4)