First-ever asymptotic for E.P. Stein numbers proved with an AI collaborator, published on arXiv
arampell · x · 2026-11-05
Cameron Rampell spent months working with an AI collaborator to prove the first asymptotic for E.P. Stein numbers in Epstein's put-or-take-a-square impartial combinatorial game (arXiv:2611.05898, 18 pages), with advice from Scott Kominers.
The paper proves S₂(X) = (1/π²)·X^(1/4)·log X + O(X^(1/4)) for the counting function of positions from which both legal moves lead directly to positive squares.
Related event: Teen Makes First Proof of E.P. Stein Number Asymptotics with AI(2 posts)→
More from Research
- Agents ace isolated tasks but drop to ~38% at maintaining codebases over time — FullStackFrenzy · 2026-11-05
- RoboColosseum founder: robotics lags AI because it lacks real-world benchmarks — DJiafei · 2026-11-05
- ByteDance study finds on-policy distillation leaves models 2.45-16.25% below base on out-of-distribution tasks — ByteDance · 2026-11-05
- FrontierPhysics: 56 expert tasks benchmark AI agents on end-to-end physics research — Bingran You · 2026-11-05
- VideoMemBench: new benchmark exposes major gaps in MLLMs' in-context video memory — Zhengdong Hu · 2026-11-05
- Muon-RT swaps momentum for teacher trajectory, cutting memory and beating AdamW by 2.6 points — IITK · 2026-11-05