# 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

## SOME APPLICATIONS OF ALGEBRAIC METHODS IN COMBINATORIAL GEOMETRY

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## On the number of ordinary lines determined by sets in complex space

VIEW 10 EXCERPTS

CITES BACKGROUND & METHODS

## Recent progress on scaling algorithms and applications

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES