works on
boolean matrices 1communication complexity 1equality-oracle 1factorization norm 1idempotent schur multipliers 1

From the 1 of 1 linked paper with an AI index.

collaborators
Showing math.CAShow all

1 paper · 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…