The Entropy of Square-Free Words
Baake, Michael ; Elser, Veit ; Grimm, Uwe
arXiv, 9809010 / Harvested from arXiv
Text on arXiv
Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an approximate formula which is asymptotically exact with rapid convergence in the number of letters.
Publié le : 1998-09-08
Classification:  Mathematical Physics,  Mathematics - Combinatorics 
@article{9809010,
     author = {Baake, Michael and Elser, Veit and Grimm, Uwe},
     title = {The Entropy of Square-Free Words},
     journal = {arXiv},
     volume = {1998},
     number = {0},
     year = {1998},
     language = {en},
     url = {http://dml.mathdoc.fr/item/9809010}
}

Baake, Michael; Elser, Veit; Grimm, Uwe. The Entropy of Square-Free Words. arXiv, Tome 1998 (1998) no. 0, . http://gdmltest.u-ga.fr/item/9809010/