AI Agent Helps Refresh Upper Bound Proof for Erdős Overlap Constant
kevrussell · x · 2026-07-04
New progress has been made on the long-standing open problem of Erdős's minimum overlap constant in number theory. Leveraging an n=2400 staircase construction provided by an anonymous AI search agent named "Hyra" on the EinsteinArena platform, and bridging discrete and continuous displacements via a short lemma certified with exact integer arithmetic, the author proved μ ≤ 0.3808669…, improving Haugland's 2016 upper bound record by about 5.99e-5 and narrowing the proven interval by roughly 3.1%. The lower bound remains White's μ ≥ 0.379005, meaning the problem is not yet fully resolved. The text also compares smaller floating-point values reported by AI search systems like AlphaEvolve, TTT-Discover, and SimpleTES, noting that while they feature actual constructions, they lack corresponding proofs, making them candidates rather than theorems.
More from Research
- PNAS paper shows a tiny billiard-ball system is a universal computer — undecidability lives in two dimensions — eigensteve · 2026-09-11
- New paper: Absolute pose estimation from affine cues and gravity direction — ducha_aiki · 2026-09-11
- LoMa Paper Ships REALLY HardPairs Dataset, Accepted at ECCV 2026 — ducha_aiki · 2026-09-11
- Johns Hopkins Launches Full-Stack Hands-on Robot Learning Class with SO-101 Arm Kits — _krishna_murthy · 2026-09-11
- SyncWorld: In-Context Robot World Model Simulates Unseen Views and Embodiments Zero-Shot — ChongZzZhang · 2026-09-11
- A 3D Pose Dataset for Dogs Released — ducha_aiki · 2026-09-11