1 citations · 2 across the 3 of their papers we have counts for
3 papers
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…
math.CO2010★ 1 cited
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes
Boaz Barak, Zeev Dvir, Avi Wigderson +1
A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at leas…