Monthly Archives: November 2013

Many triangulated three-spheres!

Posted on November 28, 2013 by Gil Kalai

The news Eran Nevo and Stedman Wilson have constructed triangulations with n vertices of the 3-dimensional sphere! This settled an old problem which stood open for several decades. Here is a link to their paper How many n-vertex triangulations does the 3 … Continue reading →

Posted in Combinatorics, Convex polytopes, Geometry, Open problems | Tagged Eran Nevo, Stedman Wilson | Leave a comment

NatiFest is Coming

Posted on November 1, 2013 by Gil Kalai

The conference Poster as designed by Rotem Linial A conference celebrating Nati Linial’s 60th birthday will take place in Jerusalem December 16-18. Here is the conference’s web-page. To celebrate the event, I will reblog my very early 2008 post “Nati’s … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Updates | Tagged Nati Linial | 2 Comments

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Monthly Archives: November 2013

Many triangulated three-spheres!

NatiFest is Coming

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives