A simple approach to substitution minimal subshifts
From MaRDI portal
Publication:6288653
arXiv1707.01259MaRDI QIDQ6288653FDOQ6288653
Authors: Takashi Shimomura 
Publication date: 5 July 2017
Abstract: In the study of substitution minimal subshifts, some complicated trivialities have hindered simple and general approaches. Recently, Maloney and Rust introduced the term "tame," simplifying the study. We introduce another term "-primitive" for the substitutions and show that the combination of these two conditions can characterize the minimality of substitution subshifts. We shall show that all substitution minimal subshifts can be generated by substitutions that satisfy both conditions; conversely, all substitutions that satisfy the two conditions always generate minimal subshifts. As an application, we show that the result by Damanik and Lenz that an admissible substitution subshift is minimal if and only if it is linearly repetitive is valid for all substitution subshifts. The above set of conditions can be checked by finite calculations (algorithms).
This page was built for publication: A simple approach to substitution minimal subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288653)
