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
- Diamandis: AI Cancer Navigator and $100 Genome Sequencing Close the Care Gap — PeterDiamandis · 2026-10-27
- EMNLP Oral: training-free Nexus Sampling cuts KV-cache memory 10x; OpenResearcher tops BrowseComp-Plus at 54.8% — yuz9yuz · 2026-10-27
- ICML 2026 position paper: LLM 'thinking traces' are a harmful anthropomorphism — rao2z · 2026-10-27
- Forking gap follows a power law in context frequency; masking rare n-grams shrinks it — ZimingLiu11 · 2026-10-27
- How forking happens: n-gram tables split logits into non-interacting subspaces — ZimingLiu11 · 2026-10-27
- The best LoRA explainer video yet: rank constraints meet intrinsic dimension — sophiamyang · 2026-10-27