DOIAbstract
AbstractWe extend Carpi’s results by showing that Dejean’s conjecture holds for n≥30
AbstractWe extend Carpi’s results by showing that Dejean’s conjecture holds for n≥30
The recently confirmed Dejean’s conjecture about the threshold between avoidable and unavoidable pow...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
AbstractWe estimate the extremal letter frequency in infinite words over a finite alphabet avoiding ...
We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjectur...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
AbstractDejean conjectured that the repetition threshold of a k-letter alphabet is k/(k−1),k≠3,4. Va...
AbstractAxel Thue proved that overlapping factors could be avoided in arbitrarily long words on a tw...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
AbstractThe notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), w...
AbstractWe extend Carpi’s results by showing that Dejean’s conjecture holds for n≥30
AbstractDejean conjectured that the repetition threshold for a k-letter alphabet is kk−1 when k≥5. D...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
Repetition threshold is the smallest number RT(n) such that infinitely many n-ary words contain no r...
AbstractWe give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, ov...
The recently confirmed Dejean’s conjecture about the threshold between avoidable and unavoidable pow...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
AbstractWe estimate the extremal letter frequency in infinite words over a finite alphabet avoiding ...
We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjectur...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
AbstractDejean conjectured that the repetition threshold of a k-letter alphabet is k/(k−1),k≠3,4. Va...
AbstractAxel Thue proved that overlapping factors could be avoided in arbitrarily long words on a tw...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
AbstractThe notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), w...
AbstractWe extend Carpi’s results by showing that Dejean’s conjecture holds for n≥30
AbstractDejean conjectured that the repetition threshold for a k-letter alphabet is kk−1 when k≥5. D...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
Repetition threshold is the smallest number RT(n) such that infinitely many n-ary words contain no r...
AbstractWe give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, ov...
The recently confirmed Dejean’s conjecture about the threshold between avoidable and unavoidable pow...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
AbstractWe estimate the extremal letter frequency in infinite words over a finite alphabet avoiding ...
Add to ORKG