Infinite Sequences and Pattern Avoidance

The study of combinatorics on words dates back at least to the beginning of the 20th century and the work of Axel Thue. Thue was the first to give an example of an infinite word over a three letter alphabet that contains no squares (identical adjacent blocks) xx. This result was eventually used to solve some longstanding open problems in algebra and has remarkable connections to other areas of mathematics and computer science as well. In this thesis we primarily study several variations of the problems studied by Thue in his work on repetitions in words, including some recent connections to other areas, such as graph theory. In Chapter 1 we give a brief introduction to the subject of combinatorics on words. In Chapter 2 we use uniform morphisms to construct an infinite binary word that contains no cubes xxx and no squares yy with |y| ≥ 4, thus giving a simpler construction than that of Dekking. We also use uniform morphisms to construct an infinite binary word avoiding all squares except 0², 1², and (01)², thus giving a simpler construction than that of Fraenkel and Simpson. We give some new enumeration results for these avoidance properties and solve an open problem of Prodinger and Urbanek regarding the perfect shuffle of infinite binary words that avoid arbitrarily large squares. In Chapter 3 we examine ternary squarefree words in more detail, and in Chapter 4 we study words w satisfying the property that for any sufficiently long subword w' of w, w does not contain the reversal of w' as a subword. In Chapter 5 we discuss an application of the property of squarefreeness to colourings of graphs. In Chapter 6 we study strictly increasing sequences (a(n))n≥0 of non-negative integers satisfying the equation a(a(n)) = dn. Finally, in Chapter 7 we give a brief conclusion and present some open problems