Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture
A word is called $\beta$-free if it has no factors of exponent greater than or equal to $\beta$. The repetition threshold $\mbox{RT}(k)$ is the infimum of the set of all $\beta$ such that there are arbitrarily long $k$-ary $\beta$-free words (or equivalently, there are $k$-ary $\beta$-free words of...
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2019-05, Vol.26 (2) |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!