Previous Conferences & Workshops

Tate reformulated the theory of the Riemann zeta function and its functional equation as the Mellin shadow of the Fourier transform on a certain space of function on the adeles. Conjecturally, Langlands' general automorphic L-functions and their...

It is convenient to formalize the discussion about Hamiltonian Floer theory using the language of flow categories and bimodules. In this lecture I will explain how to use the notion of "derived orbifold chart lift" of flow categories and bimodules...

Let G be a simply-connected complex semisimple algebraic group and let C be a smooth projective curve of any genus. Then, the moduli space of semistable G-bundles on C admits so called determinant line bundles. E. Verlinde conjectured a remarkable...

In this talk I will present a general framework to establish the stability of  inequalities of the form >= F(u); where L is a positive linear operator and F is a 2-homogeneous nonlinear functional.

We will then see how this framework can be...

In model theory Fraisse limits are certain highly homogeneous countable structures -- examples include the rational numbers as the unique dense linear order without endpoints, and the Rado graph as the "unique infinite random graph".  I will discuss...

A word on d letters is an element of the free group of rank d, say, with basis x_1,…,x_d. Given a word w=w(x_1,…,x_d) on d letters, for every group G, there is a word map w:G^d—> G given by substituting the x_i’s with elements of G. We say that a...

A number is called y-smooth if all of its prime factors are bounded above by y. The set of y-smooth numbers below x forms a sparse subset of the integers below x as soon as x is sufficiently large in terms of y. If f_1, …, f_r \in Z[x_1,…,x_s] is a...

I will explain how to generalize Abouzaid-McLean-Smith's construction to Floer moduli spaces. As we need to regularize infinitely many moduli spaces, we need to make choices consistently. We also need to generalize the smoothing theory to the...

We give the first almost-linear time algorithm for computing exact maximum flows and minimum-cost flows on directed graphs. By well known reductions, this implies almost-linear time algorithms for several problems including bipartite matching...