paper

Block structure in boolean matrices of bounded factorization norm

arXiv:2507.00872

Abstract

A boolean matrix is blocky if its -entries form a collection of 1-monochromatic submatrices that are disjoint in both rows and columns. Blocky matrices are precisely the set of boolean matrices with factorization norm at most . Building on recent work by Balla, Hambardzumyan, and Tomon, we show that for any boolean matrix with norm at most , there exists a a collection of row- and column-disjoint 1-monochromatic submatrices that together cover a significant portion (at least a fraction) of its -entries.

14 pages

Block structure in boolean matrices of bounded factorization norm · wovepaper