Block structure in boolean matrices of bounded factorization norm

Abstract: A blocky matrix is one that can be obtained (up to permutation of rows and columns) from an identity matrix by successively either adding a copy of a row or column or adding a zero row or column. Blocky matrices are precisely the set of boolean matrices with $|!|A|!|_{\gamma_2}= 1$. We show that for any boolean matrix $A$ with $\gamma_2$ norm at most $\lambda$, there exists a blocky matrix $B$ of the same dimensions as $A$ such that $B(i,j) = 1$ only if $A(i,j)=1$, and there are at least $1/2^{2^{O(\lambda)}}$ as many $1$-entries in $B$ as in $A$.