Nonrepetitive sequences on arithmetic progressions

From MaRDI portal
Publication:648401




Abstract: A sequence S=s1s2...n is emph{nonrepetitive} if no two adjacent blocks of S are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization of nonrepetitive sequences involving arithmetic progressions. We prove that for every kgeqslant1 and every cgeqslant1 there exist arbitrarily long sequences over at most (1+frac1c)k+18kc/c+1 symbols whose subsequences indexed by arithmetic progressions with common differences from the set 1,2,...,k are nonrepetitive. This improves a previous bound obtained in cite{Grytczuk Rainbow}. Our approach is based on a technique introduced recently in cite{GrytczukKozikMicek}, which was originally inspired by a constructive proof of the Lov'{a}sz Local Lemma due to Moser and Tardos cite{MoserTardos}. We also discuss some related problems that can be successfully attacked by this method.









This page was built for publication: Nonrepetitive sequences on arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648401)