• Computer Science, Mathematics
  • Published in
    Electronic Colloquium on…
    2012
  • DOI:10.1017/fms.2014.2

Improved rank bounds for design matrices and a new proof of Kelly's theorem

@article{Dvir2012ImprovedRB,
  title={Improved rank bounds for design matrices and a new proof of Kelly's theorem},
  author={Zeev Dvir and Shubhangi Saraf and Avi Wigderson},
  journal={ArXiv},
  year={2012},
  volume={abs/1211.0330}
}
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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 24 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Incidence Theorems and Their Applications

  • Zeev Dvir
  • Mathematics, Computer Science
  • Foundations and Trends in Theoretical Computer Science
  • 2012

Tight Lower Bounds for 2-query LCCs over Finite Fields

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits

Blackbox Polynomial Identity Testing for Depth 3 Circuits

Complexity Lower Bounds using Linear Algebra

Perturbed Identity Matrices Have High Rank: Proof and Applications

  • Noga Alon
  • Mathematics, Computer Science
  • Combinatorics, Probability & Computing
  • 2009