MERCAS, R. and NOWOTKA, D., 2016. A note on Thue games. Information Processing Letters, [in press]
In this work we improve on a result from . In particular,
we investigate the situation where a word is constructed jointly by two
players who alternately append letters to the end of an existing word.
One of the players (Ann) tries to avoid (non-trivial) repetitions, while
the other one (Ben) tries to enforce them. We show a construction that
is closer to the lower bound showed in  using entropy compression, and
building on the probabilistic arguments based on a version of the Lov´asz
Local Lemma from . We provide an explicit strategy for Ann to avoid
(non-trivial) repetitions over a 7-letter alphabet.
This paper is closed access until twelve months after publication. A pre-print version of this paper is available at: https://arxiv.org/abs/1601.02453