Topological Mixing of Random n-bonacci Substitutions

We consider shift spaces generated by maps that send a letter from a finite alphabet to a finite collection of words over the same alphabet called random substitutions. In particular, we study the topological dynamics of the shift spaces associated with the family of random n-bonacci substitutions,...

全面介紹

Saved in:
書目詳細資料
Main Authors: Mijares, Jim Ralphealo, Sinajon, Earl John, Miro, Eden Delight
格式: text
出版: Archīum Ateneo 2024
主題:
在線閱讀:https://archium.ateneo.edu/mathematics-faculty-pubs/252
https://doi.org/10.1063/5.0192129
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
實物特徵
總結:We consider shift spaces generated by maps that send a letter from a finite alphabet to a finite collection of words over the same alphabet called random substitutions. In particular, we study the topological dynamics of the shift spaces associated with the family of random n-bonacci substitutions, which is a generalization of the random Fibonacci substitution. We establish that the random n-bonacci shift spaces are not topologically mixing by showing that the substitution admits recognisable words at every level through a specialized construction.