A Propos d'une Conjecture de F. Dejean sur les Répétitions dans les Mots
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Polynomial versus exponential growth in repetition-free binary words
Journal of Combinatorial Theory Series A
Avoiding large squares in infinite binary words
Theoretical Computer Science - Combinatorics on words
Last cases of Dejean's conjecture
Theoretical Computer Science
| Hi-index | 0.00 |
A square in a word is composed of two adjacent occurrences of a nonempty word. This note gives a simple proof and a straight construction of the existence of an infinite binary word that contains only three squares. No infinite binary word can contain fewer squares. The only factors of exponent larger than two that our infinite binary word contains are two cubes. Furthermore, we provide two additional results on alphabets of size 3 and 4. We prove that there exists an infinite overlap-free ternary word containing only one square. On a 4-letter alphabet we show there exists an infinite 3/2^+-free 4-ary word containing only one 3/2-power.