Previous Conferences & Workshops

A PCP is a proof system in which the proofs that can be verified by a verifier that reads only a very small part of the proof. One line of research concerning PCPs is trying to reduce their soundness error (i.e., the probability of accepting false...

The solution to many classical counting asymptotics problems in number theory goes by comparison with an analogous volume asumptotics. In a general setting, we establish asymptotic formulae for volumes of height balls in analytic varieties over...

I will discuss several results on mean-values of multiplicative functions, notably Halasz's method for estimating such averages. In the second lecture I will show how this circle of ideas can be used to derive "weak subconvexity" bounds for L...

We present two new approximation algorithms for Unique Games. The first generalizes the results of Arora et al. who give polynomial time approximation algorithms for graphs with high conductance. We give a polynomial time algorithm assuming only...

We survey some of the points of contact between the two subjects of the title. The talk is intended for non-specialists.

In this talk I'll present a relative trace formula approach to the Gross-Zagier formula and its high dimensional generalization (a derivative version of the global Gross-Prasad conjecture) for unitary group. In particular, an arithmetic fundamental...