The minimum rank problem: A counterexample (Q2477550): Difference between revisions

A matrix with entries from the set \(\{0,+1,-1\}\) is called a sign pattern matrix. Given such a matrix \(A\) and a subfield \(\mathbb F\) of the field of real numbers the minimum rank of \(A\) over \(\mathbb F\) is defined as the minimum over the ranks of all matrices \(B\) over \(\mathbb F\) with \(\text{ sgn\,} B=A\); here the sign of \(B\) is understood elementwise. The authors give an example of a sign pattern matrix whose minimum rank over the reals is different from its minimum rank over the rational numbers. Their short and elegant proof is based on recent work of \textit{M. Arav, F. J. Hall, S. Koyuncu, Z. Li}, and \textit{B. Rao} about sign pattern matrices [Linear Algebra Appl. 409, 111--125 (2005; Zbl 1079.15001)] and a paper of \textit{S. MacLane} about the realisation of matroids in terms of configurations of points and lines [Am. J. Math. 58, 236--240 (1936; Zbl 0013.19503)].