AI brute-forces Erdős problems: Pushing multiple math frontiers in a single day
kevrussell · x · 2026-07-28
The author demonstrates astonishing progress on mathematical problems using systematic methods (likely combined with automated verification), pushing multiple boundaries in Erdős problems within a single day:
- Massive Scale: Indexed 1,217 Erdős problems, tracked 225 bounded quantities, and established 28 certificate lanes.
- Key Breakthroughs: Advanced exact values for R(C₄,K₁,n), exact tables for f(1..45), and more; closed #241 outright via cross-reference; proved a(6) > 10¹².
- Independent Verification & Corrections: Independently verified others' results like Alpöge's Jacobian Conjecture counterexample; kept 2 self-retractions, acknowledging previous computational errors (e.g., correcting a bound from 10¹³ to 10¹²).
- Dead Ends: Named 33 'walls' (proven dead ends) with reasons and scales, preventing other researchers from wasting time on them.
More from Research
- Kimi K3 technical report shows 2.5× better scaling efficiency than Kimi K2 — stochasticchasm · 2026-07-28
- Latent Action Model talk will show how to learn Super Mario from observation alone — ceciletamura · 2026-07-28
- Kimi K3 reveals its pre-training mix across text, code, math, knowledge, and vision — stochasticchasm · 2026-07-28
- GLM 5 follows up with per-head Muon to balance attention-head updates — stochasticchasm · 2026-07-28
- MLA-based KV cache costs 12 GB per million tokens, with KDA state at 230 MB BF16 — zephyr_z9 · 2026-07-28
- OpenAI chart says 43.5% of occupation-specific ChatGPT use goes beyond the user’s job — soumitrashukla9 · 2026-07-28