Monthly Archives: August 2018

An Improved Bound for Weak Epsilon-Nets in the Plane, by Nathan Rubin, is on the arXive

Posted on August 17, 2018 by Gil Kalai

The paper An Improved Bound for Weak Epsilon-Nets in the Plane, by Nathan Rubin is now on the arxive. we mentioned the result in this post, and the problem in this post (my very first) over Tao’s blog What’s New. … Continue reading →

Posted in Combinatorics, Geometry | Tagged Nathan Rubin, weak epsilon net | Leave a comment

ICM2018 First Report

Posted on August 12, 2018 by Gil Kalai

I just came back from Rio from a great congress. Many great talks and many exciting meetings with old and new friends. I had planned to live-blog on the last four days of the congress but on Monday evening I … Continue reading →

Posted in Combinatorics, Conferences, ICM2018, Updates | Tagged ICM2018, ICM2022 | 2 Comments

	Throwing Dice Proble… on TYI 30: Expected number of Dic…
	Sam Hopkins on A Nice Example Related to the…
	yaroslav shitov on ICM 2022 awarding ceremonies…
	tanner808 on The Trifference Problem
	Anurag Bishnoi on The Trifference Problem
	Na wiskundige opwind… on Amazing: Justin Gilmer gave a…
	Matthew Cory on Ordinary computers can beat Go…
	Quantum computer sup… on Ordinary computers can beat Go…
	Greatest Hits 2015-2… on Alexander A. Gaifullin: Many 2…
	Greatest Hits 2015-2… on Chaim Even-Zohar, Tsviqa Lakre…
	Greatest Hits 2015-2… on James Davies: Every finite col…
	Greatest Hits 2015-2… on Joshua Hinman proved Bárány…

Monthly Archives: August 2018

An Improved Bound for Weak Epsilon-Nets in the Plane, by Nathan Rubin, is on the arXive

ICM2018 First Report

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives