Tag Archives: Dan Spielman

Erdős Lectures 2014 – Dan Spielman

Posted on May 16, 2014 by Gil Kalai

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 | 50 Comments

	Peter Shor on The story of Poincaré and his…
	Gil Kalai on What do Firms Want?
	Gil Kalai on Noisy quantum circuits: how do…
	World News OK, WTF I… on Quantum computers: amazing pro…
	Quantum computers: a… on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Gil Kalai on The story of Poincaré and his…
	Craig on The story of Poincaré and his…
	Rao on The story of Poincaré and his…
	Tom Copeland on Richard Ehrenborg’s prob…
	Marco Tomamichel on The story of Poincaré and his…
	Gil Kalai on The story of Poincaré and his…

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