Rank-3 scale theorems: Difference between revisions

@@ Line 95: / Line 95: @@
 # u_s + A_0 X,
 where u_L and u_s are the larger and smaller B_0-steps of w_X.
-Some B_0-step, say u_L, occurs at least K = ceil(n(w_X)/2) = ceil((b+c)/2) times. If K = 1, then b = c = 1, this case should be relatively easy to deal with...
-If K >= 2, then ...
-Chunks of consecutive X's, separated by at most 2 non-X letters, can come in sizes that differ by at most 2 (including 0), by MV3.
 ...