Consecutive Power Occurrences in Sturmian Words
We show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by $10$ and this bound is optimal, extending a result of Rampersad, who proved that the bound $9$ holds for the Fibonacci word. We then give a gen...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Académie des sciences
2024-11-01
|
| Series: | Comptes Rendus. Mathématique |
| Subjects: | |
| Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.644/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|