Title of article
Dejeanʹs conjecture and letter frequency
Author/Authors
Chalopin، نويسنده , , Jérémie and Ochem، نويسنده , , Pascal، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
501
To page
505
Abstract
We prove two cases of a strong version of Dejeanʹs conjecture involving extremal letter frequencies. The results are that there exist an infinite ( 5 4 + ) -free word over a 5 letter alphabet with letter frequency 1 6 and an infinite ( 6 5 + ) -free word over a 6 letter alphabet with letter frequency 1 5 .
Keywords
repetition threshold , letter frequency , Combinatorics on words
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454632
Link To Document