From Boolean to sign pattern matrices
A matrix whose entries are \(+\) or \(0\) is called a nonnegative sign pattern matrix. A Boolean matrix is a \((0,1)\) matrix with the usual arithmetic except that \(1+1=1\). The paper concerns characterizations of the nonnegative sign patterns that allow several types of nonnegative (or positive) generalized inverses. Motivated by results of \textit{P. Rao} and \textit{B. Rao} [Linear Algebra Appl. 11, 135--153 (1975; Zbl 0322.15011)] on Boolean matrices, the authors establish some connections between such matrices and nonnegative sign pattern matrices. They also provide some links between the minimum rank of a nonnegative sign pattern matrix and the Boolean row (or column) rank of a Boolean matrix.
- A geometric treatment of non-negative generalized inverses
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 825098 (Why is no real title available?)
- Idempotence for sign-pattern matrices
- Inverses of nonnegative matrices
- On generalized inverses of Boolean matrices
- Sign pattern matrices and generalized inverses
- The Generalized Inverse of a Nonnegative Matrix
- Tan's epsilon-determinant and ranks of matrices over semirings
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations
- Ray pattern of Drazin inverses of some matrices
- Rational realizations of the minimum rank of a sign pattern matrix
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- Essential sign change numbers of full sign pattern matrices
- From real to complex sign pattern matrices
- Minimum (maximum) rank of sign pattern tensors and sign nonsingular tensors
- Sign Patterns That Allow a Positive or Nonnegative Left Inverse
This page was built for publication: From Boolean to sign pattern matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703635)