Fraenkel word: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m →Facts |
||
| Line 11: | Line 11: | ||
</math> | </math> | ||
== Facts == | == Facts == | ||
{{theorem|contents=Fraenkel words are [[balanced]].}} | {{theorem|contents=As circular words, Fraenkel words are [[balanced]].}} | ||
TODO: proof | 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. | ||
Revision as of 22:06, 9 February 2024
A Fraenkel word over n letters [math]\displaystyle{ \mathbf{0}, \mathbf{1}, ..., (\mathbf{n-1}) }[/math] 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]
Facts
Theorem — As circular words, Fraenkel words are balanced.
TODO: proof
Open problems
For circular words (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]\displaystyle{ F_n. }[/math][1] The conjecture is known to be true for 3 ≤ n ≤ 7.
References
- ↑ 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.