Boolean matrices, i.e., binary matrices with the usual Boolean arithmetic except that \(1+1=1\) are studied. The Boolean rank of an \(m \times n\) matrix \(A\) is the least integer \(k\) such that \(A=BC\) under Boolean arithmetic, where \(B\) and \(C\) are \(m \times k\) and \(k \times n\) Boolean matrices, respectively. A theorem is proved giving the upper bound on the Boolean rank of the Kronecker product of two matrices. An example of \(4 \times 4\) Boolean rank-1 matrices shows that this bound is not necessarily attained.
Recommendations
Cited in
(11)- Ranks of Boolean matrices
- Upper bounds on the Boolean rank of Kronecker products
- Separability of distinct Boolean rank-1 matrices
- Linear preservers of extremes of rank inequalities over semirings: the factor rank
- Matrix Invariants over Semirings
- Determining the Schein rank of Boolean matrices
- Boolean rank of upset tournament matrices
- scientific article; zbMATH DE number 833769 (Why is no real title available?)
- The Kronecker join of the Boolean matrices
- On Boolean matrices with full factor rank
- On the generic rank of matrices composed of Kronecker products
This page was built for publication: Boolean rank of Kronecker products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954858)