AbstractWe give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for 5≤k≤10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0.005. As a consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for 5≤k≤10
Repetition threshold is the smallest number RT(n) such that infinitely many n-ary words contain no r...
AbstractThe notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), w...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
AbstractWe give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, ov...
AbstractAxel Thue proved that overlapping factors could be avoided in arbitrarily long words on a tw...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
AbstractWe estimate the extremal letter frequency in infinite words over a finite alphabet avoiding ...
AbstractDejean conjectured that the repetition threshold of a k-letter alphabet is k/(k−1),k≠3,4. Va...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
Repetition threshold is the smallest number RT(n) such that infinitely many n-ary words contain no r...
AbstractThe notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), w...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
AbstractWe give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, ov...
AbstractAxel Thue proved that overlapping factors could be avoided in arbitrarily long words on a tw...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...
The recently confirmed Dejean?fs conjecture about the threshold between avoidable and unavoidable po...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
AbstractWe estimate the extremal letter frequency in infinite words over a finite alphabet avoiding ...
AbstractDejean conjectured that the repetition threshold of a k-letter alphabet is k/(k−1),k≠3,4. Va...
The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable pow...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
We investigate the finite repetition threshold for k-letter alphabets, k ≥ 4, that is the smallest n...
International audienceWe prove two cases of a strong version of Dejean's conjecture involving extrem...
International audienceThe exponent of a word is the ratio of its length over its smallest period. Th...
Repetition threshold is the smallest number RT(n) such that infinitely many n-ary words contain no r...
AbstractThe notion of the repetition threshold, which is the object of Dejean’s conjecture (1972), w...
AbstractThe (maximal) exponent of a non-empty finite word is the ratio of its length to its period. ...