boolean matrices 1communication complexity 1equality-oracle 1factorization norm 1idempotent schur multipliers 1
From the 1 of 8 linked papers with an AI index.
Showing math.CAShow all
3 papers · 1 filter
math.CA2026
A characterization of idempotent Schur multipliers
Marcel K. Goh, Csongor Beke, Hamed Hatami +2
The paper proves that any n×n Boolean matrix with bounded γ₂ factorization norm can be expressed as a signed sum of a bounded number of blow‑ups of identity matrices, giving an exp…
math.CA2025
Block complexity and idempotent Schur multipliers
Marcel K. Goh, Hamed Hatami
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,…
math.CA2025
Block structure in boolean matrices of bounded factorization norm
Marcel K. Goh, Hamed Hatami
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…