Previous Conferences & Workshops

If A is a subset of a free group with at least two non-Commuting elements, then |AAA| must be almost quadratic in |A|.

We say a problem is tractable on average if it can be solved on a "good" fraction of instances by an efficient algorithm. To make this definition precise, we need to make two choices: First, what is a "good" fraction of instances - is it 1%, 51%, 99...

p-adic height pairings are analogues of the real height pairings that show up for example in the Birch-Swinnerton Dyer conjectures on special values of L-functions of Abelian varieties. The p-adic pairings show up when one tries to formulate p-adic...

Geisser gives conjectured formulas for special values of zeta-functions of varieties over finite fields in terms of Euler characteristics of arithmetic cohomology (an improved version of Weil-etale cohomology). He then proves these formulas under...

We will present some recent developments in the quasi-geostrophic equations. We show that local solutions to critical and super-critical dissipative quasi-geostrophic equations have higher regularity, although one gets lower derivative in the...

A Property P of functions is said to be locally testable if there exists a probabilistic algorithm that makes few (constant) queries for the value of f and accepts those satisfying P while rejecting functions that are far from any function...

We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of vertices). Both the degree and the number of right-hand vertices are...