Improved bounds in Weaver's ${\rm KS}_r$ conjecture for high rank positive semidefinite matrices
Zhiqiang Xu, Zili Xu, Ziheng Zhu

TL;DR
This paper improves bounds related to Weaver's ${ m KS}_r$ conjecture for high-rank positive semidefinite matrices, refining estimates on the largest roots of mixed characteristic polynomials.
Contribution
It introduces $(k,m)$-characteristic polynomials and uses them to derive tighter bounds in the arbitrary-rank Weaver's ${ m KS}_r$ conjecture.
Findings
New bounds match known results for rank-one cases.
Sharper bounds for higher-rank matrices compared to previous work.
Improved estimates on the largest roots of mixed characteristic polynomials.
Abstract
Recently Marcus, Spielman and Srivastava proved Weaver's conjecture, which gives a positive solution to the Kadison-Singer problem. Cohen and Br\"and\'en independently extended this result to obtain the arbitrary-rank version of Weaver's conjecture. In this paper, we present a new bound in Weaver's conjecture for the arbitrary-rank case. To do that, we introduce the definition of -characteristic polynomials and employ it to improve the previous estimate on the largest root of the mixed characteristic polynomials. For the rank-one case, our bound agrees with the Bownik-Casazza-Marcus-Speegle's bound when and with the Ravichandran-Leake's bound when . For the higher-rank case, we sharpen the previous bounds from Cohen and from Br\"and\'en .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Matrix Theory and Algorithms · Mathematical Inequalities and Applications
