LetKn be the cone of positive semidefinite n£n matrices and letA be an affine subspace of the space of symmetric matrices such that the intersectionKn \A is nonempty and bounded. Suppose that n ‚ 3 and that codimA D ¡rC22 ¢ for some 1 • r • n ¡ 2. Then there is a matrix X 2 Kn \A such that rank X • r. We give a short geometric proof of this result, use it to improve a bound on realizability of weighted graphs as graphs of distances between points in Euclidean space, and describe its relation to theorems of Bohnenblust, Friedland and Loewy, and Au-Yeung and Poon
Let Mn(R) and Sn(R) be the spaces of n × n real matri-ces and real symmetric matrices respectively. ...
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
Let K n be the cone of positive semidefinite n X n matrices and let Å be an affine subspace of the s...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
AbstractSeveral inequalities relating the rank of a positive semidefinite matrix with the ranks of v...
AbstractFor a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A...
Thesis (Ph.D.)--University of Washington, 2014The positive semidefinite (psd) rank of a nonnegative ...
Let A be an n-by-n matrix with real entries. We show that a necessary and sufficient condition for A...
Let Mn(R) and Sn(R) be the spaces of n × n real matri-ces and real symmetric matrices respectively. ...
Abstract. Let M ∈ Rp×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is th...
Let M∈R^p×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is the smallest ...
Let Mn(R) and Sn(R) be the spaces of n × n real matri-ces and real symmetric matrices respectively. ...
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
Let K n be the cone of positive semidefinite n X n matrices and let Å be an affine subspace of the s...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
For a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A=[ai,j] ...
AbstractSeveral inequalities relating the rank of a positive semidefinite matrix with the ranks of v...
AbstractFor a graph G=(V,E) with V={1,…,n}, let S(G) be the set of all real symmetric n×n matrices A...
Thesis (Ph.D.)--University of Washington, 2014The positive semidefinite (psd) rank of a nonnegative ...
Let A be an n-by-n matrix with real entries. We show that a necessary and sufficient condition for A...
Let Mn(R) and Sn(R) be the spaces of n × n real matri-ces and real symmetric matrices respectively. ...
Abstract. Let M ∈ Rp×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is th...
Let M∈R^p×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is the smallest ...
Let Mn(R) and Sn(R) be the spaces of n × n real matri-ces and real symmetric matrices respectively. ...
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...