Answers are grounded in this paper and cite their sources.
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. This paper also introduces r-fold orthogonal representations of graphs and formalizes the understanding of projective rank as fractional orthogonal rank. Connections of these concepts to quantum theory, including Tsirelson's problem, are discussed.
No takes yet. Share an insight, caveat, or question.
Hogben et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: