The Shortest Interesting Binary Words
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929698618998784 |
|---|---|
| author | Fici, Gabriele |
| author_facet | Fici, Gabriele |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_21145 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Shortest Interesting Binary Words Fici, Gabriele Combinatorics Formal Languages and Automata Theory 68R15 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. |
| title | The Shortest Interesting Binary Words |
| topic | Combinatorics Formal Languages and Automata Theory 68R15 |
| url | https://arxiv.org/abs/2412.21145 |