Upper Bounds on the Boolean Rank of Kronecker Products

Ishay Haviv, Michal Parnas

The Boolean rank of a $0,1$-matrix $A$, denoted $R_{\mathbb{B}}(A)$, is the smallest number of monochromatic combinatorial rectangles needed to cover the $1$-entries of $A$. In 1988,…