diff b34550f..6fbd3ac ordered_binary_polynomial_removal_v2.txt
diff --git a/ordered_binary_polynomial_removal_v2.txt b/ordered_binary_polynomial_removal_v2.txt index df04b85..64fe7ad 100644 --- a/ordered_binary_polynomial_removal_v2.txt +++ b/ordered_binary_polynomial_removal_v2.txt @@ -124,7 +124,7 @@ whenever dist_H >= eps, so Conjecture 2.1 is false. The exponent 132 is 2k with k = 66. The notation (386h + 2) will show up as d_h; it counts one coordinate (row or column) in units of a block of size m. -Section 8 derives the "consequently" from the two displayed inequalities. +Section 8 derives the "consequently" from the two displayed ineualities. ============================================================================== 4. THE FIXED PATTERN H @@ -567,7 +567,7 @@ such cell, fixing its row image and column image uses one row index and one column index of H; there are at most n^(k-1) ways to choose the other row indices and at most n^(k-1) ways for the other column indices, and the increasing order and prescribed entries can only reduce these counts. So -N_H(A_h) <= m * n^(2k-2). Dividing by n^(2k) gives the second inequality +N_H(A_h) <= m * n^(2k-2). Dividing by n^(2k) gives the second ineuality since n = d_h m and m = 2^h. END PROOF. REMARK 7.7 (hitting is not the same as repairing). Flip the m cells of L_h