A note on constructing infinite binary words with polynomial subword complexity

Most of the constructions of infinite words having polynomial subword complexity are quite complicated, e.g. , sequences of Toeplitz, sequences defined by billiards in the cube, etc. In this paper, we describe a simple method for constructing infinite words w over a binary alphabet  { a,b  }  with polynomial subword complexity p w . Assuming w contains an infinite number of a ’s, our method is based on the gap function which gives the distances between consecutive b ’s. It is known that if the gap function is injective, we can obtain at most quadratic subword complexity, and if the gap function is blockwise injective, we can obtain at most cubic subword complexity. Here, we construct infinite binary words w such that p w (n ) = Θ (n β ) for any real number β  > 1.