Tag Archives: Yuansi Chen

To Cheer You Up in Difficult Times 15: Yuansi Chen Achieved a Major Breakthrough on Bourgain’s Slicing Problem and the Kannan, Lovász and Simonovits Conjecture

This post gives some background to  a recent amazing breakthrough  paper: An Almost Constant Lower Bound of the Isoperimetric Coefficient in the KLS Conjecture by Yuansi Chen. Congratulations Yuansi! The news Yuansi Chen gave an almost constant bounds for Bourgain’s … Continue reading

Posted in Combinatorics, Computer Science and Optimization, Convexity, Geometry | Tagged | 2 Comments