Polytopes of Minimum Positive Semidefinite Rank
نویسندگان
چکیده
منابع مشابه
Polytopes of Minimum Positive Semidefinite Rank
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k × k real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a polytope is at least the dimension of the polytope plus one, and we characterize those polytopes whose psd rank equals this lower bound.
متن کاملComputing Positive Semidefinite Minimum Rank for Small Graphs
Abstract. The positive semidefinite minimum rank of a simple graph G is defined to be the smallest possible rank over all 1 positive semidefinite real symmetric matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero 2 otherwise. The computation of this parameter directly is difficult. However, there are a number of known bounding parameters 3 and technique...
متن کاملCompletely Positive Semidefinite Rank
An n×n matrix X is called completely positive semidefinite (cpsd) if there exist d×d Hermitian positive semidefinite matrices {Pi}i=1 (for some d ≥ 1) such that Xij = Tr(PiPj), for all i, j ∈ {1, . . . , n}. The cpsd-rank of a cpsd matrix is the smallest d ≥ 1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate twofold. First, the c...
متن کاملPositive semidefinite rank
The positive semidefinite (psd) rank of a nonnegative real matrix M is the smallest integer k for which it is possible to find psd matrices Ai assigned to the rows of M and Bj assigned to the columns of M , of size k ˆ k, such that pi, jq-entry of M is the inner product of Ai and Bj . This is an example of a cone rank of a nonnegative matrix similar to nonnegative rank, and was introduced for s...
متن کاملOrthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
Fractional minimum positive semidefinite rank is defined from r-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An r-fold version of the traditional definition of minimum positive semidefinite rank of a graph using Hermitian matrices that fit the graph is also presented. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2013
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-013-9533-x