On the minimal components of substitution subshifts
Dynamical Systems
2026-02-16 v3
Abstract
In this paper we study substitutions on where is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The explicitness of these results provides a method to algorithmically compute and count the minimal components of a given substitution subshift.
Keywords
Cite
@article{arxiv.2501.19326,
title = {On the minimal components of substitution subshifts},
author = {Raphaël Henry},
journal= {arXiv preprint arXiv:2501.19326},
year = {2026}
}