Tag Archives: Dan Spielman

Erdős Lectures 2014 – Dan Spielman

Posted on May 16, 2014 by Gil Kalai

Image | Posted on May 16, 2014 by Gil Kalai | Tagged Dan Spielman, Paul Erdos | 1 Comment

The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava

Posted on June 19, 2013 by Gil Kalai

…while we keep discussing why mathematics is possible… The news Adam Marcus, Dan Spielman, and Nikhil Srivastava posted a paper entitled “Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem,” where they prove the 1959 Kadison-Singer conjecture. (We discussed part … Continue reading →

Posted in Analysis, Computer Science and Optimization, Physics, Updates | Tagged Adam Marcus, Dan Spielman, Jean Bourgain, Lior Tzafriri, Nikhil Srivastava, The Kadison-Singer Conjecture | 44 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…

Tag Archives: Dan Spielman

Erdős Lectures 2014 – Dan Spielman

The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives