Antipowers in Uniform Morphic Words and the Fibonacci Word

Abstract

Fici, Restivo, Silva, and Zamboni define a $k$-antipower to be a word composed of $k$ pairwise distinct, concatenated words of equal length. Berger and Defant conjecture that for any sufficiently well-behaved aperiodic morphic word $w$, there exists a constant $c$ such that for any $k$ and any index $i$, a $k$-antipower with block length at most $ck$ starts at the $i$th position of $w$. They prove their conjecture in the case of binary words, and we extend their result to alphabets of arbitrary finite size and characterize those words for which the result does not hold. We also prove their conjecture in the specific case of the Fibonacci word.

8 pages

References in corpus (4)

• Anti-Powers in Infinite Words
• Algorithms for Anti-Powers in Strings
• Anti-power $j$-fixes of the Thue-Morse word
• Anti-Powers in Primitive Uniform Substitutions

Cited by in corpus (1)

• Anti-Powers in Primitive Uniform Substitutions