Some structural properties of low-rank matrices related to computational complexity

Abstract We consider the problem of the presence of short cycles in the graphs of nonzero elements of matrices which have sublinear rank and nonzero entries on the main diagonal, and analyze the connection between these properties and the rigidity of matrices. In particular, we exhibit a family of matrices which shows that sublinear rank does not imply the existence of triangles. This family can also be used to give a constructive bound of the order of k 3/2 on the Ramsey number R(3,k) , which matches the best-known bound. On the other hand, we show that sublinear rank implies the existence of 4-cycles. Finally, we prove some partial results towards establishing lower bounds on matrix rigidity and consequently on the size of logarithmic depth arithmetic circuits for computing certain explicit linear transformations.

[1]  Richard Sinkhorn,et al.  Concerning nonnegative matrices and doubly stochastic matrices , 1967 .

[2]  P. Erdös,et al.  Intersection Theorems for Systems of Sets , 1960 .

[3]  László Lovász,et al.  The rank and size of graphs , 1996, J. Graph Theory.

[4]  Richard Bellman,et al.  Introduction to Matrix Analysis , 1972 .

[5]  Joel Friedman,et al.  A note on matrix rigidity , 1993, Comb..

[6]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Ran Raz,et al.  On the “log rank”-conjecture in communication complexity , 1995, Comb..

[8]  J. Spencer.  Intersection Theorems for Systems of Sets , 1977, Canadian Mathematical Bulletin.

[9]  Vojtech Rödl,et al.  Boolean Circuits, Tensor Ranks, and Communication Complexity , 1997, SIAM J. Comput..

[10]  Rephael Wenger,et al.  Extremal graphs with no C4's, C6's, or C10's , 1991, J. Comb. Theory, Ser. B.

[11]  Leslie G. Valiant,et al.  Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.

[12]  László Lovász,et al.  The rank and size of graphs , 1996 .

[13]  Moshe Rosenfeld.  Almost Orthogonal Lines in Ed , 1990, Applied Geometry And Discrete Mathematics.

[14]  Abraham Lempel,et al.  Matrix Factorization Over GF(2) and Trace-Orthogonal Bases of GF(2n) , 1975, SIAM J. Comput..

[15]  Richard A. Brualdi,et al.  Combinatorial matrix theory , 1991 .

[16]  A. Razborov,et al.  Improved lower bounds on the rigidity of Hadamard matrices , 1998 .

[17]  Zoltán Füredi,et al.  On finite set-systems whose every intersection is a Kernel of a star , 1983, Discret. Math..

[18]  Noga Alon,et al.  Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..