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
- AI slop is already clogging PR review and weakening the credit system behind science — rbhar90 · 2026-07-27
- ICML 2026 oral paper replication scores stay middling after a stricter re-scoring — profjamesevans · 2026-07-27
- Long-running agents will need immutable event logs, this thread argues — sebpaquet · 2026-07-27
- Seed IQ navigates Doom II, prompting questions about benchmarks beyond ARC-AGI — Fit_Transition8824 · 2026-07-27
- Agentic Data Science in Practice: Agents Write Code but Answer Wrong Questions — hugobowne · 2026-07-27
- A concise canon of foundational papers in ML, systems, NLP, speech, and audio — deliprao · 2026-07-27