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

Posted on December 21, 2020 by Gil Kalai

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 Yuansi Chen | 2 Comments

	Animated Logical Gra… on Chomskian Linguistics
	To cheer you up in d… on Chomskian Linguistics
	Gil Kalai on Igor Pak: What if they are all…
	karimadiprasito on Igor Pak: What if they are all…
	Gil Kalai on Igor Pak: What if they are all…
	Karim Adiprasito on Amazing: Simpler and more gene…
	Gil Kalai on Amazing: Simpler and more gene…
	Science Advisor \| Gö… on To cheer you up in difficult t…
	Science Advisor \| Gö… on Igor Pak: What if they are all…
	Karim Adiprasito on Amazing: Simpler and more gene…
	Anonymous on Amazing: Simpler and more gene…
	Amazing: Simpler and… on Four Derandomization Problems

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

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives