Beyond minimal substitution subshifts
Date(s) : 14/10/2025 iCal
11h00 - 12h00
In the study of general (i.e. not necessarily minimal) substitution subshifts on ℤ, it is known that every such subshift has a finite number of minimal components. Even better: the size of the alphabet is an upper bound for growing substitutions. This number can be seen as a measure of how « non-minimal » a subshift is. In this talk, we manage to describe and compute the minimal components of these systems, using the characterization of minimal subshifts, which provides upper bounds in the general case.
Emplacement
I2M Luminy - TPR2, Salle de Séminaire 304-306 (3ème étage)
Catégories
