Fraenkel word: Difference between revisions

Line 68:

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.

=== Other conjectures ===

'''Conjecture:''' Let MV(''s'') denote the [[maximum variety]] of the circular word ''s''. ~~For every ''k'' ≥ 1,~~ MV(''F''2''k'') ~~−~~ MV(''F''2''k''~~−1~~) = MV(''F''2''k''+1) ~~− MV(''F''2~~''k''~~)~~.

'''Conjecture:''' Let MV(''s'') denote the [[maximum variety]] of the circular word ''s''. Then {MV(''F''2''k''−1), MV(''F''2''k''), MV(''F''2''k''+1)} is an arithmetic progression for every ''k'' ≥ 1.

== See also ==

@@ Line 68: / Line 68: @@
 For [[circular word]]s (equivalently, infinite periodic words), '''Fraenkel's conjecture''' asserts that the only [[balanced]] circular words over ''n'' &ge; 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 &le; ''n'' &le; 7.
 === Other conjectures ===
-'''Conjecture:''' Let MV(''s'') denote the [[maximum variety]] of the circular word ''s''. For every ''k'' &ge; 1, MV(''F''<sub>2''k''</sub>) &minus;  MV(''F''<sub>2''k''&minus;1</sub>) = MV(''F''<sub>2''k''+1</sub>) &minus;  MV(''F''<sub>2''k''</sub>).
+'''Conjecture:''' Let MV(''s'') denote the [[maximum variety]] of the circular word ''s''. Then {MV(''F''<sub>2''k''&minus;1</sub>), MV(''F''<sub>2''k''</sub>), MV(''F''<sub>2''k''+1</sub>)} is an arithmetic progression for every ''k'' &ge; 1.
 == See also ==