Back to Featured
Microsoft Research BlogXinzhi Zhang2026-10-22 00:0026 days ago

Microsoft Research and collaborators prove the 31-year-old KLS conjecture

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

AI Briefing

Microsoft Research's Xinzhi Zhang and Zhao Song prove the Kannan–Lovász–Simonovits (KLS) conjecture, proposed in 1995, showing that the gap between optimal hyperplane cuts and arbitrary-shaped cuts for log-concave distributions is bounded by a universal constant rather than growing with dimension.

Also reported by 1 other source

Source: Microsoft Research Blog · microsoft.com

Event follow-up1

View all event coverage

Finished reading the news? Let’s talk about your business.

Leave your contact details, and I’ll get in touch with you personally.

WECHAT

Add me on WeChat

Press and hold or select the WeChat ID below to copy it.