A new approach to nonrepetitive sequences

2011/03/31 by Jarosław Grytczuk, Jakub Kozik, Piotr Micek
Mathematics · Computer Science · #math.CO #cs.DM

paper · pdf · doi:10.1002/rsa.20411

5 pages, no figures.arXiv admin note: substantial text overlap with arXiv:1103.3810

arxiv created 2011/11/22 · arxiv updated 2014/10/23

Abstract

A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long nonrepetitive sequence. It is still not settled whether the following extension holds: for every sequence of 3-element sets L₁,..., L_n there exists a nonrepetitive sequence s₁, ..., s_n with s_i∈ L_i. Applying the probabilistic method one can prove that this is true for sufficiently large sets L_i. We present an elementary proof that sets of size 4 suffice (confirming the best known bound). The argument is a simple counting with Catalan numbers involved. Our approach is inspired by a new algorithmic proof of the Lovász Local Lemma due to Moser and Tardos and its interpretations by Fortnow and Tao. The presented method has further applications to nonrepetitive games and nonrepetitive colorings of graphs.

Citations

• Nonrepetitive games