The Shortest Interesting Binary Words
Gabriele Fici

TL;DR
This paper identifies two specific binary words of lengths 4 and 6 that are fundamental in various combinatorial problems, highlighting their significance across multiple research works.
Contribution
The paper introduces the concept of the shortest interesting binary words and demonstrates their importance in combinatorics on words.
Findings
Two binary words of lengths 4 and 6 are central to many combinatorial problems.
These words are frequently cited in combinatorics literature.
They serve as key examples in multiple research contexts.
Abstract
I will show that there exist two binary words (one of length 4 and one of length 6) that play a special role in many different problems in combinatorics on words. They can therefore be considered \textit{the shortest interesting binary words}. My claim is supported by the fact that these two words appear in dozens of papers in combinatorics on words.
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
Topicssemigroups and automata theory · Advanced Algebra and Logic · Algorithms and Data Compression
