Fraenkel word: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
|||
| Line 11: | Line 11: | ||
</math> | </math> | ||
== Open problems == | == 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:Terms]] | ||
Revision as of 21:44, 9 February 2024
A Fraenkel word over n letters is defined recursively by
[math]\displaystyle{ \displaystyle{ \begin{align*} F_1 &= \mathbf{0}, \\ F_2 &= \mathbf{010}, \\ F_3 &= \mathbf{0102010}, \\ &\ \ \vdots \\ F_{n} &= F_{n-1}(\mathbf{n-1})F_{n-1}. \end{align*}} }[/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.