An infinite square-free word w over a three letter alphabet T is said to have a k-stem sigma if w = sigma w(1)w(2) ... where for each i, there exists a permutation pi(i) of T which extended to a morphism gives w(i) = pi(i)(sigma). We show that there exists an infinite k-stem word for k = 1, 2, 3, 9 and 13 = 20 remains open. (C) 2011 Elsevier B.V. All rights reserved
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutiv...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
AbstractOne way to generate infinite k-power-free words is to iterate a k-power-free morphism, that ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
All sufficiently long binary words contain a square but there are infinite binary words having only ...
The lexicographically least square-free infinite word on the alphabet of non-negative integers with ...
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of ...
We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with ...
A position p in a word w is critical if the minimal local period at p is equal to the global period ...
AbstractLet h be a morphism satisfying h(a) = ax for a letter a and a nonempty word x. Then h define...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutiv...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
AbstractOne way to generate infinite k-power-free words is to iterate a k-power-free morphism, that ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
All sufficiently long binary words contain a square but there are infinite binary words having only ...
The lexicographically least square-free infinite word on the alphabet of non-negative integers with ...
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of ...
We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with ...
A position p in a word w is critical if the minimal local period at p is equal to the global period ...
AbstractLet h be a morphism satisfying h(a) = ax for a letter a and a nonempty word x. Then h define...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutiv...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
AbstractOne way to generate infinite k-power-free words is to iterate a k-power-free morphism, that ...
DOI
Add to ORKG