The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold
James Currie, Narad Rampersad

TL;DR
This paper identifies the lexicographically smallest infinite binary rich word that reaches a specific critical exponent, contributing to the understanding of combinatorial properties of binary words.
Contribution
It introduces the first construction of the lexicographically least infinite binary rich word with a given critical exponent.
Findings
The critical exponent of the word is $2+\sqrt{2}/2$
The word is the lexicographically least with this property
Provides insights into the structure of rich binary words
Abstract
We find the lexicographically least infinite binary rich word having critical exponent
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Coding theory and cryptography
