2000 character limit reached
The Repetition Threshold for Rote Sequences
Published 25 Jun 2024 in math.CO, cs.DM, and cs.FL | (2406.17867v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
