paper

Sign patterns of rational matrices with large rank

arXiv:1312.5369

Abstract

Let be a real matrix. The term rank of is the smallest number of lines (that is, rows or columns) needed to cover all the nonzero entries of . We prove a conjecture of Li et al. stating that, if the rank of exceeds , there is a rational matrix with the same sign pattern and rank as those of . We point out a connection of the problem discussed with the Kapranov rank function of tropical matrices, and we show that the statement fails to hold in general if the rank of does not exceed .

arXiv comment5 pages