Bibliographic Details
| Title: |
Low complexity binary words avoiding (5/2)+-powers. |
| Authors: |
Currie, James1, Rampersad, Narad1 |
| Source: |
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2025, Vol. 27 Issue 3, p1-12. 12p. |
| Subjects: |
Binary sequences, Combinatorics, Scholars |
| Abstract: |
Rote words are infinite words that contain 2n factors of length n for every n ≥ 1. Shallit and Shur, as well as Ollinger and Shallit, showed that there are Rote words that avoid (5/2)+-powers and that this is best possible. In this note we give a structure theorem for the Rote words that avoid (5/2)+-powers, confirming a conjecture of Ollinger and Shallit. [ABSTRACT FROM AUTHOR] |
|
Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
