Fraenkel word: Difference between revisions
Created page with "A '''Fraenkel word''' over ''n'' letters is defined recursively by <math>\displaystyle{ \begin{align*} F_1 &= \mathbf{0}, \\ F_2 &= \mathbf{010}, \\ F_3 &= \mathbf{0102010},..." |
mNo edit summary |
||
| Line 10: | Line 10: | ||
\end{align*}} | \end{align*}} | ||
</math> | </math> | ||
== Open problems == | |||
Fraenkel's conjecture implies that the only primitive circular words over at least 3 letters that have "step count vectors" with pairwise distinct components are Fraenkel words. The conjecture is known to be true for [[arity]] 3 to 7. | Fraenkel's conjecture implies that the only primitive circular words over at least 3 letters that have "step count vectors" with pairwise distinct components are Fraenkel words. The conjecture is known to be true for [[arity]] 3 to 7. | ||
[[Category:Terms]][[Category:Combinatorics on words]][[Category:Math]] | [[Category:Terms]] | ||
[[Category:Combinatorics on words]] | |||
[[Category:Math]] | |||
[[Category:Articles with open problems]] | |||