Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem

@article{Marcus2013InterlacingFI,
  title={Interlacing families II: Mixed characteristic polynomials and the Kadison\{Singer problem},
  author={A. Marcus and D. Spielman and N. Srivastava},
  journal={Annals of Mathematics},
  year={2013},
  volume={182},
  pages={327-350}
}
We use the method of interlacing polynomials introduced in our previous article to prove two theorems known to imply a positive solution to the Kadison{Singer problem. The rst is Weaver’s conjecture KS 2, 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… Expand
383 Citations

References

SHOWING 1-10 OF 95 REFERENCES
Minimal sequences and the Kadison-Singer problem
The Kadison–Singer Problem in mathematics and engineering
  • P. Casazza, J. Tremain
  • Medicine, Mathematics
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2006
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
The random paving property for uniformly bounded matrices
Frames and the Feichtinger conjecture
...
1
2
3
4
5
...