Asset Details
Do you wish to reserve the book?
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
Do you wish to request the book?
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Interlacing families II: Mixed characteristic polynomials and the Kadison—Singer problem
2015
Overview
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 first is Weaver's conjecture KS2, 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.
Publisher
Department of Mathematics at Princeton University
