Van Vu

most citedRandom symmetric matrices are almost surely non-singular

9 citations · 13 across the 4 of their papers we have counts for

collaborators

4 papers

math.NT2005

Long arithmetic progressions in sumsets: Thresholds and Bounds

E. Szemeredi, V. Vu

For a set $A$ of integers, the sumset $l A = A + ... + A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $l A = {a_{1} + ... a_{l} ∣ a_{i} \in A_{i}} .$ A clo…

math.NT2005★ 4 cited

Olson's theorem for cyclic groups

V. Vu

Let $n$ be a large number. A subset $A$ of $Z_{n}$ is complete if $S_{A} = Z_{n}$ , where $S_{A}$ is the collection of the subset sums of $A$ . Olson proved that if $n$ is a prime and $|A|>…

math.PR2005★ 9 cited

Random symmetric matrices are almost surely non-singular

Kevin Costello, Terence Tao, Van Vu

Let $Q_{n}$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove…

math.PR2005

Central limit theorems for random polytopes in a smooth convex set

Van Vu

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, de…