Microsoft Research· Xinzhi Zhang·· 5 h ago
Solving a 31-year-old grand challenge in mathematics – the KLS conjecture
Solving a 31-year-old grand challenge in mathematics – the KLS conjecture
AI summary
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995.
Selection record
Threshold 60Official, first-handFirst 71Second 72
AdmittedSum of both 143 ≥ twice the threshold 120
- Source tier
- Official, first-hand; this tier's threshold is 60
- Pre-filter
- passed：人机协作AI智能体探索数学证明
- Why it was chosen
- Microsoft researchers prove the KLS conjecture through human-directed agentic search, showing how work is divided between people and AI in mathematical discovery.
A model scores each item twice, independently, against one written standard, out of 100. An item is admitted only when the two scores add up to twice the threshold. The threshold is set per source tier.
Source: Microsoft Research · microsoft.com