A 46-year Erdős-Graham conjecture is closed with a Claude-plus-GPT proof pipeline
RexDouglass · x · 2026-07-25
A 46-year-old conjecture by Erdős and Graham has been closed. The result says degree-2 polynomials still fail the tiling property, but every polynomial of degree 3 or higher appears to satisfy it. The proof was produced by a MathDyad pair: Claude did aiming and verification, GPT-5.6 Sol Pro handled reasoning, and the authors note they have not yet been independently checked by a mathematician.
More from Research
- Fast ViT shows strong ImageNet results; scaling runs needed next — ducha_aiki · 2026-09-11
- Loss Functions Are Scientific Assumptions: MSE Implies Gaussian Noise, Cross-Entropy Implies Bernoulli — bravo_abad · 2026-09-11
- SymKit MCP: 44 tools for AI agents to verify symbolic derivations — Foreign-Specific-604 · 2026-09-11
- Researchers: LLMs under pressure invent new languages unreadable to humans — mikeflache · 2026-09-11
- Mi-Ripple fixes ripple artifacts left by iterative AI image editing — Miyang-AI · 2026-09-11
- DRG-MAPPO uses dynamic role graphs to boost multi-agent air combat win rates — China666 · 2026-09-11