Abstract: In this work we improve on a result from~cite{GryKosZma15}. 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~cite{GryKozMic13} using entropy compression, and building on the probabilistic arguments based on a version of the Lov'asz Local Lemma from~cite{Peg11}. We provide an explicit strategy for Ann to avoid (non-trivial) repetitions over a -letter alphabet.
Recommendations
Cites work
Cited in
(7)- A note on bus games
- How to play Thue games
- Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters
- scientific article; zbMATH DE number 1786177 (Why is no real title available?)
- scientific article; zbMATH DE number 7110189 (Why is no real title available?)
- Corrigendum to ``A note on Thue games
- Highly nonrepetitive sequences: winning strategies from the local Lemma
This page was built for publication: A note on Thue games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344549)
