We show that there exists an infinite word over the alphabet {0,1,3,4} containing no three consecutive blocks of the same size and the same sum. This answers an open problem of Pirillo and Varricchio from1994
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
peer reviewedWe identify the structure of the lexicographically least word avoiding 5/4-powers on th...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
The study of combinatorics on words dates back at least to the beginning of the 20th century and t...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
The present thesis is dedicated to the various aspects of the problem of avoiding additive cubes in ...
The present thesis is dedicated to the various aspects of the problem of avoiding additive cubes in ...
AbstractThe following is proved: (1) There exists an infinite binary sequence having no triple repet...
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of...
We find an infinite word w on four symbols with the following property: Two occurrences of any block...
We characterize the squares occurring in infinite overlap-free binary words and construct various α ...
AbstractWe prove the following results: (1) There exists an infinite binary sequence having no ident...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
An infinite square-free word w over a three letter alphabet T is said to have a k-stem sigma if w = ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
peer reviewedWe identify the structure of the lexicographically least word avoiding 5/4-powers on th...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
The study of combinatorics on words dates back at least to the beginning of the 20th century and t...
Richomme asked the following question: what is the infimum of the real numbers α > 2 such that there...
AbstractAn infinite square-free word w over a three letter alphabet T is said to have a k-stem σ if ...
The present thesis is dedicated to the various aspects of the problem of avoiding additive cubes in ...
The present thesis is dedicated to the various aspects of the problem of avoiding additive cubes in ...
AbstractThe following is proved: (1) There exists an infinite binary sequence having no triple repet...
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of...
We find an infinite word w on four symbols with the following property: Two occurrences of any block...
We characterize the squares occurring in infinite overlap-free binary words and construct various α ...
AbstractWe prove the following results: (1) There exists an infinite binary sequence having no ident...
The study of combinatorics on words dates back at least to the beginning of the 20th century and the...
An infinite square-free word w over a three letter alphabet T is said to have a k-stem sigma if w = ...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
peer reviewedWe identify the structure of the lexicographically least word avoiding 5/4-powers on th...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
DOI
Add to ORKG