Corpus ID: 235458432

# Improved bounds in Weaver's ${\rm KS}_r$ conjecture for high rank positive semidefinite matrices

@inproceedings{Xu2021ImprovedBI,
title={Improved bounds in Weaver's \$\{\rm KS\}\_r\$ conjecture for high rank positive semidefinite matrices},
author={Zhiqiang Xu and Zili Xu and Ziheng Zhu},
year={2021}
}
• Zhiqiang Xu
• Published 2021
• Mathematics
Recently Marcus, Spielman and Srivastava proved Weaver’s KSr conjecture, which gives a positive solution to the Kadison-Singer problem. In [Coh16, Brä18], Cohen and Brändén independently extended this result to obtain the arbitrary-rank version of Weaver’s KSr conjecture. In this paper, we present a new bound in Weaver’s KSr conjecture for the arbitrary-rank case. To do that, we introduce the definition of (k,m)characteristic polynomials and employ it to improve the previous estimate on the… Expand

#### References

SHOWING 1-10 OF 39 REFERENCES
Asymptotically Optimal Multi-Paving
• Mathematics
• 2017
Anderson's paving conjecture, now known to hold due to the resolution of the Kadison-Singer problem asserts that every zero diagonal Hermitian matrix admits non-trivial pavings with dimensionExpand
Mixed determinants and the Kadison–Singer problem
• Mathematics
• 2016
We adapt the arguments of Marcus, Spielman and Srivastava in their proof of the Kadison–Singer problem to prove improved paving estimates. Working with Anderson’s paving formulation of Kadison–SingerExpand
Hyperbolic polynomials and the Kadison-Singer problem
Recently Marcus, Spielman and Srivastava gave a spectacular proof of a theorem which implies a positive solution to the Kadison-Singer problem via Weaver’s KSr conjecture. We extend this theorem toExpand
Interlacing families II: Mixed characteristic polynomials and the Kadison{Singer problem
• Mathematics
• 2013
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 conjectureExpand
Improved bounds in Weaver and Feichtinger Conjectures
• Mathematics
• 2015
We sharpen the constant in the $KS_2$ conjecture of Weaver \cite{We}, which was validated by Marcus, Spielman, and Srivastava \cite{MSS} in their solution of the Kadison--Singer problem. We thenExpand
Principal submatrices, restricted invertibility and a quantitative Gauss-Lucas theorem
We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restrictedExpand
Obstructions to determinantal representability
There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has beenExpand
Multivariate Pólya-Schur classification problems in the Weyl algebra
• Mathematics
• 2006
A multivariate polynomial is stable if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra A(n) thatExpand
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
• Mathematics, Computer Science
• 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2013
The existence of infinite families of (c, d)-biregular bipartite graphs with all non-trivial eigenvalues bounded by √c-1+√d-1, for all c, d ≥ q 3 is proved. Expand
Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products
• Mathematics
• 2006
For (n x n)-matrices A and B, define eta(A, B) = Sigma(S)det(A[S])det(B[S']), where the summation is over all subsets of {1,..., n}, S' is the complement of S', and A [S] is the principal submatrixExpand