The minimal density of a letter in an infinite ternary square-free word is 883/3215
Journal of integer sequences, Tome 10 (2007) no. 6
The problem of determining the minimal density of a letter in an infinite ternary square-free word was investigated by Tarannikov and Ochem. In this paper we solve this problem, and prove that the minimal density is equal to 883 . 3215
Classification :
11B05
Keywords: combinatorics on words, square-free word, factorial languages, minimal density
Keywords: combinatorics on words, square-free word, factorial languages, minimal density
@article{JIS_2007__10_6_a2,
author = {Khalyavin, Andrey},
title = {The minimal density of a letter in an infinite ternary square-free word is 883/3215},
journal = {Journal of integer sequences},
year = {2007},
volume = {10},
number = {6},
zbl = {1140.11304},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2007__10_6_a2/}
}
Khalyavin, Andrey. The minimal density of a letter in an infinite ternary square-free word is 883/3215. Journal of integer sequences, Tome 10 (2007) no. 6. http://geodesic.mathdoc.fr/item/JIS_2007__10_6_a2/