Proof of a conjecture of Krawchuk and Rampersad

Abstract

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal behavior of c(n), where c(n) counts the number of length-n factors of the Thue-Morse word t, up to cyclic rotation.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…