1 citations · 1 across the 4 of their papers we have counts for
4 papers
Matching-Vector Families and LDCs Over Large Modulo
Zeev Dvir, Guangda Hu
We prove new upper bounds on the size of families of vectors in with restricted modular inner products, when is a large integer. More formally, if $\vec{u}_1,\ldots,\v…
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…
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…
Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers
Zeev Dvir, Swastik Kopparty, Shubhangi Saraf +1
We extend the "method of multiplicities" to get the following results, of interest in combinatorics and randomness extraction. (A) We show that every Kakeya set (a set of points th…