Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

### Paper:

TR22-079 | 25th May 2022 18:38

#### Lower Bound Methods for Sign-rank and their Limitations

TR22-079
Authors: Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao
Publication: 25th May 2022 23:42
Keywords:

Abstract:

The sign-rank of a matrix $A$ with $\pm 1$ entries is the smallest rank of a real matrix with the same sign pattern as $A$. To the best of our knowledge, there are only three known methods for proving lower bounds on the sign-rank of explicit matrices: (i) Sign-rank is at least the VC-dimension; (ii) Forster's method, which states that sign-rank is at least the inverse of the largest possible average margin among the representations of the matrix by points and half-spaces; (iii) Sign-rank is at least a logarithmic function of the density of the largest monochromatic rectangle.

We prove several results regarding the limitations of these methods.

$\bullet$ We prove that, qualitatively, the monochromatic rectangle density is the strongest of these three lower bounds. If it fails to provide a super-constant lower bound for the sign-rank of a matrix, then the other two methods will fail as well.
$\bullet$ We show that there exist $n \times n$ matrices with sign-rank $n^{\Omega(1)}$ for which none of these methods can provide a super-constant lower bound.
$\bullet$ We show that sign-rank is at most an exponential function of the deterministic communication complexity with access to an equality oracle. We combine this result with Green and Sanders' quantitative version of Cohen's idempotent theorem to show that for a large class of sign matrices (e.g., XOR-lifts), sign-rank is at most an exponential function of the $\gamma_2$ norm of the matrix. We conjecture that this holds for all sign matrices.
$\bullet$ Towards answering a question of Linial, Mendelson, Schechtman, and Shraibman regarding the relation between sign-rank and discrepancy, we conjecture that sign-ranks of the $\pm1$ adjacency matrices of hypercube graphs can be arbitrarily large. We prove that none of the three lower bound techniques can resolve this conjecture in the affirmative.

ISSN 1433-8092 | Imprint