AbstractLet k be fixed, 1 <k< 2. There exists an infinite word over a finite alphabet which contains no subword of the form xyz with |xyz |/| xy | ≥k and where z is a permutation of x
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-po...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of...
peer reviewedWe identify the structure of the lexicographically least word avoiding 5/4-powers on th...
Combinatorics on words is a relatively recent area of discrete mathematics, which finds its roots in...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
We find an infinite word w on four symbols with the following property: Two occurrences of any block...
AbstractBrandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smal...
The recently confirmed Dejean’s conjecture about the threshold between avoidable and unavoidable pow...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-po...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
International audienceIt is commonly admitted that the origin of combinatorics on words goes back to...
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of...
peer reviewedWe identify the structure of the lexicographically least word avoiding 5/4-powers on th...
Combinatorics on words is a relatively recent area of discrete mathematics, which finds its roots in...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
We find an infinite word w on four symbols with the following property: Two occurrences of any block...
AbstractBrandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smal...
The recently confirmed Dejean’s conjecture about the threshold between avoidable and unavoidable pow...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-po...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
DOI
Add to ORKG