Unary patterns under permutations

Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, and other questions of recent interest. Unary patterns with permutations have been previously analysed only for lengths up to 3. Consider a pattern p = π i 1 ( x ) … π i r ( x ), with r ≥ 4, x a word variable over an alphabet Σ and π i j function variables, to be replaced by morphic or antimorphic permutations of Σ. If | Σ | ≥ 3, we show the existence of an infinite word avoiding all pattern instances having | x | ≥ 2. If | Σ | = 3 and all π i j are powers of a single morphic or antimorphic π, the length restriction is removed. For the case when π is morphic, the length dependency can be removed also for | Σ | = 4, but not for | Σ | = 5, as the pattern x π 2 ( x ) π 56 ( x ) π 33 ( x ) becomes unavoidable. Thus, in general, the restriction on x cannot be removed, even for powers of morphic permutations. Moreover, we show that for every positive integer n there exists N and a pattern π i 1 ( x ) … π i n ( x ) which is unavoidable over all alphabets Σ with at least N letters and π morphic or antimorphic permutation.

Authors

• James Currie
• Florin Manea
• Dirk Nowotka
• Kamellia Reshadi

Keywords

• Combinatorics on words
• Avoidable patterns
• Patterns under permutations