Decidability of the isomorphism and the factorization between minimal substitution subshifts - Laboratoire Amiénois de Mathématique Fondamentale et Appliquée - UMR CNRS 7352 Accéder directement au contenu
Article Dans Une Revue Discrete Analysis Année : 2022

Decidability of the isomorphism and the factorization between minimal substitution subshifts

Résumé

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic, but the existing invariants are not sufficient for this purpose. We first show that given two minimal substitution subshifts, there exists a computable constant R such that any factor map between these sub-shifts (if any) is the composition of a factor map with a radius smaller than R and some power of the shift map. Then we prove that it is decid-able to check whether a given sliding block code is a factor map between two prescribed minimal substitution subshifts. As a consequence of these two results, we provide an algorithm that, given two minimal substitution subshifts, decides whether one is a factor of the other and, as a straightforward corollary, whether they are isomorphic.
Fichier principal
Vignette du fichier
durand2021.pdf (649 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02461469 , version 1 (30-01-2020)
hal-02461469 , version 2 (11-08-2022)

Identifiants

Citer

Fabien Durand, Julien Leroy. Decidability of the isomorphism and the factorization between minimal substitution subshifts. Discrete Analysis, 2022, 65 p. ⟨10.19086/da.36901⟩. ⟨hal-02461469v2⟩
111 Consultations
108 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More