Previous Conferences & Workshops

We give an algorithmic proof of Forster's Theorem, a fundamental result in communication complexity. Our proof is based on a geometric notion we call radial isotropic position which is related to the well-known isotropic position of a set of vectors...

It has been recently observed that function spaces associated to a symplectic manifold exhibit unexpected properties and surprising structures, giving rise to new tools and intuition in symplectic topology. In the talk I shall discuss these...

The question whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an exponential rate) the error in interactive proofs and (at a weak exponential...

In the mid 80's Margulis proved the Oppenheim Conjecture regarding values of indefinite quadratic forms. I will present new work, joint with Margulis, where we quantify this statement by giving bounds on the size of integer vectors for which |Q(x)|...

For the last 5 years or so Terry Tao and I have been working on a programme to prove certain conjectures of Hardy and Littlewood concerning the number of primes vectors p = (p_1, . . . ,p_n) in some box which satisfy the equation Ap = b . The number...

Many biological tissues behave like viscous fluids on long timescales and posses a macroscopic, measurable surface tension. This surface tension correlates strongly with tissue type and successfully explains cell sorting of embryonic tissues. Both...

Green and Tao used the existence of a dense subset indistinguishable from the primes under certain tests from a certain class to prove the existence of arbitrarily long prime arithmetic progressions. Reingold, Trevisan, Tulsiani and Vadhan, and...

I will report on a joint work with Ronny Hadani (UT Austin) and Amit Singer (Princeton). We give an algorithmic solution to the two problems that appear in the title. The input is the numerical data (roughly, random plane sections of the molecule)...

We give new results on the number-on-the-forhead (NOF) communication complexity of the multiparty pointer jumping problem. The origional motivation for this problem comes from circuit complexity. Specifically, there is no explicit function known to...