IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et al.  [Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes. Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC 11 , (ACM, NY 2011), 519–528] in which they were used to answer questions regarding point configurations. In this work, we derive near-optimal rank bounds for these matrices and use them to obtain asymptotically tight bounds in many of the geometric applications. As a consequence of our improved analysis, we also obtain a new, linear algebraic, proof of Kelly’s theorem, which is the complex analog of the Sylvester–Gallai theorem.

[1]  Alexander A. Sherstov,et al.  The Sign-rank of Ac , 2008 .

[2]  Zeev Dvir,et al.  Tight Lower Bounds for 2-query LCCs over Finite Fields , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[3]  Noga Alon,et al.  Perturbed Identity Matrices Have High Rank: Proof and Applications , 2009, Combinatorics, Probability and Computing.

[4]  Sten Hansen.  A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set. , 1965 .

[5]  Shubhangi Saraf,et al.  Blackbox Polynomial Identity Testing for Depth 3 Circuits , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Alexander A. Razborov,et al.  The Sign-Rank of AC^O , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Alex Samorodnitsky,et al.  A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.

[8]  Satyanarayana V. Lokam.  Complexity Lower Bounds using Linear Algebra , 2009, Found. Trends Theor. Comput. Sci..

[9]  Noam D. Elkies,et al.  Sylvester–Gallai Theorems for Complex Numbers and Quaternions , 2004, Discret. Comput. Geom..

[10]  Jürgen Forster,et al.  A linear lower bound on the unbounded error probabilistic communication complexity , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[11]  R. Bellman,et al.  Problems for Solution: 4065-4069 , 1943 .

[12]  L. M. Kelly,et al.  A resolution of the sylvester-gallai problem of J.-P. serre , 1986, Discret. Comput. Geom..

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

[14]  Vladimir D. Tonchev,et al.  Polarities, quasi-symmetric designs, and Hamada’s conjecture , 2009, Des. Codes Cryptogr..

[15]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, FOCS.

[16]  Avi Wigderson,et al.  Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes , 2010, STOC '11.

[17]  Zeev Dvir,et al.  Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..

[18]  Shaun M. Fallat,et al.  The minimum rank of symmetric matrices described by a graph: A survey☆ , 2007 .

[19]  U. Rothblum,et al.  Scalings of matrices which have prespecified row sums and column sums via optimization , 1989 .

[20]  Nitin Saxena,et al.  From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[21]  Richard Sinkhorn.  A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[22]  Zeev Dvir,et al.  Incidence Theorems and Their Applications , 2012, Found. Trends Theor. Comput. Sci..

[23]  Anthony J. W. Hilton,et al.  On Double Diagonal and Cross Latin Squares , 1973 .

[24]  N. Hamada,et al.  On the $p$-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes , 1973 .

[25]  Alexander A. Razborov,et al.  The Sign-Rank of AC0 , 2010, SIAM J. Comput..

[26]  Zeev Dvir,et al.  Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits , 2005, STOC '05.

[27]  L. Moser,et al.  Problems for Solution , 1962, Canadian Mathematical Bulletin.

[28]  Yuval Ishai,et al.  On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR , 2007, APPROX-RANDOM.

[29]  P. Borwein,et al.  A survey of Sylvester's problem and its generalizations , 1990 .