A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Polynomial removal fails for ordered binary matrices
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Hamilton's Revenge <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.7 out of 5 (7,768 votes)

>>> How to Play <<<
Polynomial removal fails for ordered binary matrices. Disproves polynomial ordered binary matrix removal with one fixed $66\times66$ 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.

>>> Level Select <<<
released 2026-09-25  |  1 theorem · 4 lemmas · 9 proofs · 5,471 words  |  PLAY LEVEL 1 »  (pdf)
We construct a fixed $66\times66$ binary matrix for which ordered matrix removal has no polynomial bound. This disproves the polynomial ordered binary matrix-removal conjecture. Ordered copies preserve the separate row and column orders and match both zeros and ones; removal permits changing entries in either direction.

More Combinatorics Games!
The sharp constant in random triangle removalExact cycle–clique Ramsey numbersA power improvement in the Heilbronn triangle problemA counterexample to the Gopalan–Servedio conjecture
A counterexample to periodic tiling in dimension three HOT!Borsuk's conjecture fails in dimension nine HOT!Counterexamples to the Hadwiger and Colin de Verdière conjecturesThe Euclidean plane cannot be colored with five colors PLAYABLE!

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games