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
- MissionReport benchmark: only 3 of 540 AI-generated government reports pass all criteria — Exp_Mark · 2026-10-27
- Finch 1: a geospatial foundation model trained on imagery from 50+ sensors — Scobleizer · 2026-10-27
- Skyfall AI's SKY-001 world model turns sketches into CAD builds in 3.9s, vs 199s for GPT-6 Astra — rohanpaul_ai · 2026-10-27
- Physicists Let AI Pick Its Own Problem—It Wrote a Publishable Paper in 2 Hours — burny_tech · 2026-10-27
- Researcher flags unresolved data transparency issues in compositionality evals — najoungkim · 2026-10-27
- Separate Forms from Estimators: Why Steer by Difference of Means When You Can Use SGD? — johnhewtt · 2026-10-27