Avoiding and Enforcing Repetitive Structures in Words
The focus of this thesis is on the study of repetitive structures in words, a central topic in the area of combinatorics on words. The results presented in the thesis at hand are meant to extend and enrich the existing theory concerning the appearance and absence of such structures. In the first part we examine whether these structures necessarily appear in infinite words over a finite alphabet. The repetitive structures we are concerned with involve functional dependencies between the parts that are repeated. In particular, we study avoidability questions of patterns whose repetitive structure is disguised by the application of a permutation. This novel setting exhibits the surprising behaviour that avoidable patterns may become unavoidable in larger alphabets. The second and major part of this thesis deals with equations on words that enforce a certain repetitive structure involving involutions in their solution set. Czeizler et al. (2009) introduced a generalised version of the classical equations u^l = v^mw^n that were studied by Lyndon and Schützenberger. We solve the last two remaining and most challenging cases and thereby complete the classification of these equations in terms of the repetitive structures appearing in the admitted solutions. In the final part we investigate the influence of the shuffle operation on words avoiding ordinary repetitions. We construct finite and infinite square-free words that can be shuffled with themselves in a way that preserves square-freeness. We also show that the repetitive structure obtained by shuffling a word with itself is avoidable in infinite words.