Minimum ranks of sign patterns via sign vectors and duality

From MaRDI portal
Publication:3448196




Abstract: A {it sign pattern matrix} is a matrix whose entries are from the set +,,0. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A. It is shown in this paper that for any mimesn sign pattern A with minimum rank n2, rational realization of the minimum rank is possible. This is done using a new approach involving sign vectors and duality. It is shown that for each integer ngeq9, there exists a nonnegative integer m such that there exists an nimesm sign pattern matrix with minimum rank n3 for which rational realization is not possible. A characterization of mimesn sign patterns A with minimum rank n1 is given (which solves an open problem in Brualdi et al. cite{Bru10}), along with a more general description of sign patterns with minimum rank r, in terms of sign vectors of certain subspaces. A number of results on the maximum and minimum numbers of sign vectors of k-dimensional subspaces of mathbbRn are obtained. In particular, it is shown that the maximum number of sign vectors of 2-dimensional subspaces of mathbbRn is 4n+1. Several related open problems are stated along the way.




Cited in
(25)






This page was built for publication: Minimum ranks of sign patterns via sign vectors and duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448196)