Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions

DOI10.13001/1081-3810.3102zbMath1375.15043arXiv1502.00016OpenAlexW1511608292MaRDI QIDQ4594662

Kevin F. Palmowski, David E. Roberson, Simone Severini, Leslie Hogben

Publication date: 24 November 2017

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.00016

zbMATH Keywords

fractionalgraphmatrixTsirelson's problemorthogonal representationprojective rankminimum positive semidefinite rank

Mathematics Subject Classification ID

Applications of graph theory (05C90) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Orthogonal matrices (15B10) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (4)

Fractional zero forcing via three-color forcing games ⋮ Fractional minimal rank ⋮ A unified construction of semiring-homomorphic graph invariants ⋮ Spectral lower bounds for the orthogonal and projective ranks of a graph

This page was built for publication: Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions