Fraenkel word: Difference between revisions
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]] | ||