AI ResearchMachine Learning6 min reading time

Microsoft Researcher and Collaborator Prove 31-Year-Old KLS Conjecture

Unite.AI
Read the full article
Microsoft Research's Xinzhi Zhang and collaborator Zhao Song proved the 31-year-old Kannan–Lovász–Simonovits (KLS) conjecture, resolving a major open problem in high-dimensional geometry and probability with a fixed universal bound. Their 140-page paper, submitted to arXiv in October 2026, shows that the KLS constant is bounded above by a universal constant, improving on previous bounds that grew with dimension. This breakthrough was achieved using a human-directed agentic AI research process.

More in AI Research

AI Research3 min read

OpenAI announces new discoveries in mathematics, computer science and physics

Engadget
AI Research3 min read

OpenAI Trumpets 3 More Math and Science Results, Along With a New Plan for Publishing Them

Covered by 2 sources
AI Research4 min read

OpenAI says its AI model has disproved the Exponential Time Hypothesis

The Next Web