User:Inthar/MV3: Difference between revisions
| Line 52: | Line 52: | ||
First assume for simplicity that len(C) = 2. Then there are only three possible lengths: 2Y, 2Z, Y+Z. Suppose all 3 occur. By (*), 2Y and 2Z cannot occur within the same contiguous string. We're assuming S has at least one X. | First assume for simplicity that len(C) = 2. Then there are only three possible lengths: 2Y, 2Z, Y+Z. Suppose all 3 occur. By (*), 2Y and 2Z cannot occur within the same contiguous string. We're assuming S has at least one X. | ||
YY YZ ZY ZZ | |||
[_ _] [_ _] [_ _] [_ _] | 0 [_ _] [_ _] [_ _] [_ _] | ||
[_ X _] [_ X _] [_ X _] [_ X _] | 1 [_ X _] [_ X _] [_ X _] [_ X _] | ||
[_ X X _] [_ X X _] [_ X X _] [_ X X _] | 2 [_ X X _] [_ X X _] [_ X X _] [_ X X _] | ||
[_ X X X _] [_ X X X _] [_ X X X _] [_ X X X _] | 3 [_ X X X _] [_ X X X _] [_ X X X _] [_ X X X _] | ||
=== Lemma 2: Sizes of chunks of any fixed letter form a MOS (except in the case "XYZYX") === | === Lemma 2: Sizes of chunks of any fixed letter form a MOS (except in the case "XYZYX") === | ||