The ordered matrix removal conjecture asks for polynomial quantitative bounds when eliminating a fixed binary matrix pattern from a larger binary matrix. For a fixed
pattern 
,
a copy in an 
matrix 
uses increasing row indices and increasing column indices,
independently, and matches every zero and one of 
. Write 
for the number of these copies. The matrix is 
-far from 
-free if at least 
entries must be changed to eliminate every copy.
The conjectural estimate has the form
 |
with positive constants depending only on 
.
