Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers (Q1010731): Difference between revisions

Summary: We use a technique based on matroids to construct two nonzero patterns \(Z_1\) and \(Z_2\) such that the minimum rank of matrices described by \(Z_1\) is less over the complex numbers than over the real numbers, and the minimum rank of matrices described by \(Z_2\) is less over the real numbers than over the rational numbers. The latter example provides a counterexample to a conjecture by \textit{M. Arav}, \textit{F.J. Hall}, \textit{S. Koyucu}, \textit{Z. Li}, and \textit{B. Rao} [``Rational realizations of the minimum rank of a sign pattern matrix'', Linear Algebra Appl. 409, 111--125 (2005; Zbl 1079.15001)] about rational realization of minimum rank of sign patterns. Using \(Z_1\) and \(Z_2\), we construct symmetric patterns, equivalent to graphs \(G_1\) and \(G_2\), with the analogous minimum rank properties. We also discuss issues of computational complexity related to minimum rank.