The paving conjecture for zero-diagonal operators
Let be the -dimensional Hilbert space, let be a linear operator on whose matrix has zero diagonal, and for let denote the orthogonal projection onto the coordinates indexed by . A partition of cbrace{1,\ldots,n\} is called a paving of if it has parts. The paving conjecture. For every , there exists a natural number such that, for every natural number and every such operator , there is a paving satisfying
This conjecture is equivalent to the Kadison–Singer problem and concerns uniform blockwise smallness of zero-diagonal operators.
References
Status
- Solved: Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava. Interlacing Families II: Mixed Characteristic Polynomials and the Kadison–Singer Problem (Annals of Mathematics, 2015) https://arxiv.org/abs/1306.3969
Source: Peter G. Casazza, Matt Fickus, Dustin Mixon and Janet C. Tremain, “Concrete constructions of non-pavable projections”, arXiv:1005.2164 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.