Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem — mentioned by ddinh

Wed, 06 Dec 2017 00:36:44 GMT

Quick note that the article is from 2015, and the MSS result dates back to 2013. There's a blog post by Nikhil here that explains the proof of the discrepancy result that implies Kadison-Singer: https://windowsontheory.org/2013/07/11/discrepancy-graphs-an... The main result is a theorem that replaces a Chernoff bound (saying here that a random partition has discrepancy logarithmic in the number of vectors with high probability) with a bound that says achieves a better bound on the discrepancy, independent of the number of vectors, at the cost of replacing the "with high probability" with…

Paper and discussion history. A mention is not an endorsement.

Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem — mentioned by espeed

Sun, 06 Dec 2015 01:16:39 GMT

Here's a link to the referenced paper where Marcus, Spielman, and Srivastava present their proof: "Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem" http://arxiv.org/pdf/1306.3969v4.pdf

Paper and discussion history. A mention is not an endorsement.

Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem · HackerPapers discussions

Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem — mentioned by ddinh

Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem — mentioned by espeed