A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,−, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in Rr−1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established., Wei Fang, Wei Gao, Yubin Gao, Fei Gong, Guangming Jing, Zhongshan Li, Yanling Shao, Lihua Zhang., and Obsahuje seznam literatury
By a sign pattern (matrix) we mean an array whose entries are from the set $\lbrace +,-,0\rbrace $. The sign patterns $A$ for which every real matrix with sign pattern $A$ has the property that its inverse has sign pattern $A^T$ are characterized. Sign patterns $A$ for which some real matrix with sign pattern $A$ has that property are investigated. Some fundamental results as well as constructions concerning such sign pattern matrices are provided. The relation between these sign patterns and the sign patterns of orthogonal matrices is examined.