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

Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava

Research output: Contribution to journalArticlepeer-review

173 Scopus citations

Abstract

We use the method of interlacing polynomials introduced in our previ-ous article to prove two theorems known to imply a positive solution to the Kadison-Singer problem. The first is Weaver's conjecture KS2, which is known to imply Kadison-Singer via a projection paving conjecture of Ake-mann 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 polyno-mials" of a collection of matrices.

Original languageEnglish (US)
Pages (from-to)327-350
Number of pages24
JournalAnnals of Mathematics
Volume182
Issue number1
DOIs
StatePublished - Jan 1 2015

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'Interlacing families II: Mixed characteristic polynomials and the Kadison-Singer problem'. Together they form a unique fingerprint.

Cite this