Block Complexity and Idempotent Schur Multipliers

We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column. Blocky matrices are precisely the boolean matrices that are contractive when considered as Schur multipliers. It is conjectured that any boolean matrix with Schur multiplier norm at most γ is expressible as a signed sum align*&A = ∑ᵢ₌₁L ± Bᵢalign* for some blocky matrices Bᵢ, where L depends only on γ. This conjecture is an analogue of Green and Sanders’ quantitative version of Cohen’s idempotent theorem. In this paper, we prove bounds on L that are polylogarithmic in the dimension of A. Concretely, if A is an n× n matrix, we show that one may take L = 2^O(γ ⁷) log (n)².