The Repetition Threshold for Rote Sequences
Abstract
We consider Rote words, which are infinite binary words with factor complexity 2n. We prove that the repetition threshold for this class is 5/2. Our technique is purely computational, using the Walnut theorem prover and a new technique for generating automata from morphisms due to the first author and his co-authors.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.