Boolean rank of Kronecker products

The Boolean rank of an m×n binary matrix A is the least integer k such that A is the product of m×k and k×n binary matrices, under Boolean arithmetic. The product of the Boolean ranks of two matrices A and B is an upper bound on the Boolean rank of their Kronecker product. An example is given to show that this bound need not be tight.