MathDB
IMO Shortlist 2011, Combinatorics 6

Source: IMO Shortlist 2011, Combinatorics 6

July 12, 2012
combinatoricsCombinatorics of wordsIMO Shortlist

Problem Statement

Let nn be a positive integer, and let W=x1x0x1x2W = \ldots x_{-1}x_0x_1x_2 \ldots be an infinite periodic word, consisting of just letters aa and/or bb. Suppose that the minimal period NN of WW is greater than 2n2^n.
A finite nonempty word UU is said to appear in WW if there exist indices kk \leq \ell such that U=xkxk+1xU=x_k x_{k+1} \ldots x_{\ell}. A finite word UU is called ubiquitous if the four words UaUa, UbUb, aUaU, and bUbU all appear in WW. Prove that there are at least nn ubiquitous finite nonempty words.
Proposed by Grigory Chelnokov, Russia