Boolean rank of Kronecker products (Q5954858): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:10, 30 January 2024
scientific article; zbMATH DE number 1702105
Language | Label | Description | Also known as |
---|---|---|---|
English | Boolean rank of Kronecker products |
scientific article; zbMATH DE number 1702105 |
Statements
Boolean rank of Kronecker products (English)
0 references
17 September 2002
0 references
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.
0 references
Boolean rank
0 references
Kronecker product
0 references
binary matrix
0 references
Boolean matrices
0 references
Boolean arithmetic
0 references