Fraenkel word: Difference between revisions
No edit summary |
No edit summary |
||
| Line 10: | Line 10: | ||
\end{align*}} | \end{align*}} | ||
</math> | </math> | ||
== Facts == | |||
{{theorem|contents=Fraenkel words are [[balanced]].}} | |||
TODO: proof | |||
== Open problems == | == Open problems == | ||
For [[circular word]]s (equivalently, infinite periodic words), '''Fraenkel's conjecture''' asserts that the only [[balanced]] circular words over ''n'' ≥ 3 letters with letter occurrences pairwise distinct are (letter reassignments of) <math>F_n.</math><ref>Bulgakova, D. V., Buzhinsky, N., & Goncharov, Y. O. (2023). On balanced and abelian properties of circular words over a ternary alphabet. Theoretical Computer Science, 939, 227-236.</ref> The conjecture is known to be true for 3 ≤ ''n'' ≤ 7. | For [[circular word]]s (equivalently, infinite periodic words), '''Fraenkel's conjecture''' asserts that the only [[balanced]] circular words over ''n'' ≥ 3 letters with letter occurrences pairwise distinct are (letter reassignments of) <math>F_n.</math><ref>Bulgakova, D. V., Buzhinsky, N., & Goncharov, Y. O. (2023). On balanced and abelian properties of circular words over a ternary alphabet. Theoretical Computer Science, 939, 227-236.</ref> The conjecture is known to be true for 3 ≤ ''n'' ≤ 7. | ||