Topological Semi-Mixing of Random n-bonacci Substitutions
Document Type
Conference Proceeding
Publication Date
1-24-2024
Abstract
We consider shift spaces generated by maps, called random substitutions, that send a letter from a finite alphabet to a finite collection of words over the same alphabet. Specifically, we study the dynamics of the shift spaces generated by the family of random n-bonacci substitutions, which is a generalization of the famous Fibonacci substitution. Using a numeration system derived from a sequence of lengths, we show that, although such shift spaces are known to be non-mixing, they satisfy a weaker condition called semi-mixing.
Recommended Citation
Jim Ralphealo Mijares, Earl John Sinajon, Eden Delight Miro; Topological semi-mixing of random n-bonacci substitutions. AIP Conf. Proc. 24 January 2024; 3016 (1): 060005. https://doi.org/10.1063/5.0192544
