“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”
Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem
We use the method of interlacing families of polynomials introduced to prove two theorems known to imply a positive solution to the Kadison--Singer problem. The first is Weaver's conjecture $KS_{2}$ \cite{weaver}, which is known to imply Kadison--Singer via a projection paving conjecture of Akemann and Anderson. The second is a formulation due to Casazza, et al., of Anderson's original paving conjecture(s), for which we are able to compute explicit paving bounds. The proof involves an analysis of the largest roots of a family of polynomials that we call the "mixed characteristic polynomials" of a collection of matrices.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“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-and-the-kadison-singer-conjecture-2/ The main result is a theorem that replaces a Chernoff bound (sayi…”