Tag Archives: Andrew Suk

The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.

Posted on May 4, 2016 by Gil Kalai

Here is the abstract of a recent paper by Andrew Suk. (I heard about it from a Facebook post by Yufei Zhao. I added a link to the original Erdős Szekeres’s paper.) Let ES(n) be the smallest integer such that … Continue reading →

Posted in Combinatorics, Geometry, Updates | Tagged Andrew Suk | 5 Comments

	Gil Kalai on Polymath Plus AI
	Leon Sexl on Polymath Plus AI
	Gil Kalai on The probabilistic proof that 2…
	Gil Kalai on Polymath Plus AI
	Yemon Choi on Polymath Plus AI
	Polymath News and AI… on Polymath Plus AI
	Polymath Plus AI \| C… on To cheer you up in difficult t…
	Matthew D Cory on Scott Aaronson’s View of…
	Gil Kalai on Starting Today: Kazhdan Sunday…
	Gil Kalai on Scott Aaronson’s View of…
	Itai Guez on Scott Aaronson’s View of…
	Gil Kalai on Scott Aaronson’s View of…

Tag Archives: Andrew Suk

The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives