Erdős arithmetic progressions conjecture may be solved, but the proof is unreadable
_onionesque · x · 2026-10-07
The author once predicted the Erdős conjecture on arithmetic progressions would remain unsolved for two years — and is happy that prediction failed. A claimed proof now appears to exist, though he admits it "seems unreadable for now," leaving verification pending.
Related event: Erdős Conjecture on Arithmetic Progressions Possibly Proved(2 posts)→
More from Research
- OpenAI's one-tape TM simulation implies RAM time t is in SPACE[t^4/5], says Williams — rrwilliams · 2026-10-07
- What If AI Agents Remembered Like Living Systems? A Mycelial Framework for Agent Memory — repligate · 2026-10-07
- U. Tokyo's Kavli IPMU Hires Postdocs to Build Agentic AI for Theoretical Physics — fatihdin4en · 2026-10-07
- ACL 2027 launches special theme track on LLM homogenization and knowledge collapse — TuhinChakr · 2026-10-07
- Microsoft's PrisMem evolves agent memory per-capability, beats baselines by 10.5 points on BEAM-1M — microsoft · 2026-10-07
- Google's SEER adds self-evolving event reasoning to time-series forecasting, beats SOTA on six benchmarks — google · 2026-10-07