  In this paper, we construct a uniformely recurrent infinite word of low
complexity without uniform frequencies of letters. This shows the optimality of
a bound of Boshernitzan, which gives a sufficient condition for a uniformly
recurrent infinite word to admit uniform frequencies.
