One explicit 66×66 binary pattern has no polynomial ordered matrix-removal bound: for every c,C>0 there are binary matrices far from avoiding it but with fewer than c ε^C n^132 induced ordered copies.
One explicit 66×66 binary pattern has no polynomial ordered matrix-removal bound: for every c,C>0 there are binary matrices far from avoiding it but with fewer than c ε^C n^132 induced ordered copies.
One explicit 66×66 binary pattern has no polynomial ordered matrix-removal bound: for every c,C>0 there are binary matrices far from avoiding it but with fewer than c ε^C n^132 induced ordered copies.
If correct, disproves the polynomial ordered binary matrix-removal conjecture with a fixed pattern.
Does every fixed ordered binary pattern admit a polynomial matrix-removal bound?
Publication dates and editorial changes.
OpenAI reports failure of polynomial ordered binary matrix removal
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
