The minimum rank problem: A counterexample

Swastik Kopparty, K. P.S. Bhaskara Rao

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

We provide a counterexample to a recent conjecture that the minimum rank over the reals of every sign pattern matrix can be realized by a rational matrix. We use one of the equivalences of the conjecture and some results from projective geometry. As a consequence of the counterexample we show that there is a graph for which the minimum rank of the graph over the reals is strictly smaller than the minimum rank of the graph over the rationals. We also make some comments on the minimum rank of sign pattern matrices over different subfields of R.

Original languageEnglish (US)
Pages (from-to)1761-1765
Number of pages5
JournalLinear Algebra and Its Applications
Volume428
Issue number7
DOIs
StatePublished - Apr 1 2008
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics

Keywords

  • Minimum rank
  • Minimum rank of a graph
  • Sign pattern matrix
  • Zero nonzero pattern

Fingerprint Dive into the research topics of 'The minimum rank problem: A counterexample'. Together they form a unique fingerprint.

  • Cite this