Boolean rank of Kronecker products (Q5954858)

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.