activity
20092026
most citedImproved rank bounds for design matrices and a new proof of Kelly's theorem

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing 2012Show all

2 papers · 1 filter

math.CO2012

Sylvester-Gallai type theorems for approximate collinearity

Albert Ai, Zeev Dvir, Shubhangi Saraf +1

We study questions in incidence geometry where the precise position of points is `blurry' (e.g. due to noise, inaccuracy or error). Thus lines are replaced by narrow tubes, and mor…

math.CO2012★ 1 cited

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

Zeev Dvir, Shubhangi Saraf, Avi Wigderson

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…