Upper Bounds on the Boolean Rank of Kronecker Products

The Boolean rank of a 0, 1-matrix A, denoted R-B(A), is the smallest number of monochromatic combinatorial rectangles needed to cover the 1-entries of A. In 1988, de Caen, Gregory, and Pullman asked if the Boolean rank of the Kronecker product C-n circle times C-n, is strictly smaller than the square of R-B(C-n), where C-n, is the n x n matrix with zeros on the diagonal and ones everywhere else (Carib. Conf. Comb. & Comp., 1988). A positive answer was given by Watts for n = 4 (Linear Alg. and its Appl., 2001). A result of Karchmer, Kushilevitz, and Nisan, motivated by direct-sum questions in non-deterministic communication complexity, implies that the Boolean rank of C-n circle times C-n grows linearly in that of C-n (SIAM J. Disc. Math., 1995), and thus R-B (C-n circle times C-n) < R-B (C-n)(2) for every sufficiently large n. Their proof relies on a probabilistic argument. In this work, we present a general method for proving upper bounds on the Boolean rank of Kronecker products of 0, 1-matrices. We use it to affirmatively settle the question of de Caen et al. for all integers n >= 7. We further provide an explicit construction of a cover of C-n circle times C-n, whose number of rectangles nearly matches the optimal asymptotic bound. Our method for proving upper bounds on the Boolean rank of Kronecker products might find applications in different settings as well. We express its potential applicability by extending it to the wider framework of spanoids, recently introduced by Dvir, Gopi, Gu, and Wigderson (SIAM J. Comput., 2020). (C) 2021 The Authors. Published by Elsevier B.V.