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.

Categories: math.CO cs.FL

The Shortest Interesting Binary Words