The Minimal Density of a Letter in an Infinite Ternary Square-Free Word
Mech. & Math. Department
Moscow State University
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.
Full version: pdf,
directory with programs
(Concerned with sequence
Received June 19 2006;
revised versions received May 5 2007; June 12 2007.
Published in Journal of Integer Sequences June 14 2007.
Journal of Integer Sequences home page