Tag Archives: Dan Spielman

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

	Margene on Some Philosophy of Scienc…
	Seth on Navier-Stokes Fluid Computers
	John Sidles on BosonSampling and (BKS) Noise…
	ashish soni on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Joseph Malkevitch on Navier-Stokes Fluid Computers
	gowers on Polymath5 – Is 2 logarit…
	John Sidles on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	John Sidles on Navier-Stokes Fluid Computers

Tag Archives: 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

Follow “Combinatorics and more”