Combinatorics · Oct 6, 2026
Polynomial removal fails for ordered binary matrices
Disproves polynomial ordered binary matrix removal with one fixed zero–one pattern. Matrices can require many binary-entry changes to become pattern-free while their copy density is smaller than every proposed polynomial bound in that distance. Copies preserve row and column orders and match both zeros and ones.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model