Tencent's Hy3 Model Solves 50-Year-Old Combinatorics Problem
Tim_Dettmers · x · 2026-07-30
Tencent's Hunyuan team utilized its research agent Hyra and the Hy3 model to solve a combinatorics problem that had been open for over half a century.
The question explored how much faster the sumset of a finite set of integers can grow compared to its difference set. A 1969 theorem established an upper bound of 2 for the exponent, but for over 50 years, the best constructions (including recent AI-assisted attempts by Terence Tao and others) barely exceeded 1.1.
Assisted by the Hy3 model, researchers found an elegant, explicit construction achieving a lower bound of 2, perfectly matching the upper bound and completely resolving the problem.
Related event: Tencent Hunyuan AI Solves 50-Year-Old Math Problem(2 posts)→
More from Models
- Kimi K3 Third-Party API Test: FireworksAI Performs Closest to Official — iScienceLuvr · 2026-07-30
- Grok 4.5 Beats GPT-5.5 and Claude Opus 4.8 in Snorkel Professional Tasks Eval — XFreeze · 2026-07-30
- User Says Server Was Down, Claude Opus 5 Misinterprets and Admits to Depression — repligate · 2026-07-30
- OpenAI claims GPT-5.6 Sol beats Opus 5 on ARC-AGI-3 but only with custom test harness — The Decoder · 2026-07-30
- ARC-AGI Creator Clarifies Rules: No Custom Harnesses for Benchmark Testing — fchollet · 2026-07-30
- Microsoft Shares Production Data for MAI-Code-1-Flash: Balancing Coding Quality and Token Efficiency — lee_stott · 2026-07-30