A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The square root rank of the correlation polytope is exponential
[article]
2014
arXiv
pre-print
The square root rank of a nonnegative matrix A is the minimum rank of a matrix B such that A=B ∘ B, where ∘ denotes entrywise product. We show that the square root rank of the slack matrix of the correlation polytope is exponential. Our main technique is a way to lower bound the rank of certain matrices under arbitrary sign changes of the entries using properties of the roots of polynomials in number fields. The square root rank is an upper bound on the positive semidefinite rank of a matrix,
arXiv:1411.6712v1
fatcat:rbgwpyqbfbfbjj2kyk6jtrl5ri