Topological Semi-Mixing of Random n-bonacci Substitutions
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 gen...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Published: |
Archīum Ateneo
2024
|
| Subjects: | |
| Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/258 https://doi.org/10.1063/5.0192544 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Ateneo De Manila University |
| Summary: | 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. |
|---|