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 math.COShow all

8 papers · 1 filter

math.CO2026

The Sylvester--Gallai dimension of graphs

Zeev Dvir

For an undirected graph , its \emph{Sylvester--Gallai dimension} is the largest affine dimension of a configuration of distinct real points indexed by i…

math.CO2026

Rank of incidence matrices over integers modulo a prime power

Zeev Dvir

In this note we prove an upper bound on the -rank of the incidence matrix of points and hyperplanes in , improving a recent bound of Laba…

math.CO2025

Tensor rank and dimension expanders

Zeev Dvir

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders…

math.CO2019

Fourier and Circulant Matrices are Not Rigid

Zeev Dvir, Allen Liu

The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number o…

math.CO2013

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…

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…