Previous Conferences & Workshops

Counting homomorphisms between graphs has a surprising number of applications. Many models in statistical mechanics and many questions in extremal graph theory can be phrased in these terms. We introduce a matrix, which we call the connection matrix...

I will talk about some recent joint work with Carlos Kenig on a certain type of uniqueness property for solutions of nonlinear Schrödinger equations on $R^d\times R$.

(Joint work with Richard Thomas) I will discuss K-stability and its relation to constant scalar curvature metrics. This leads to a notion of slope stability for manifolds in terms of its subschemes, which gives an obstruction to finding constant...

In this talk, we will discuss additional details of the `SL=L' result, not covered by the first talk. We will focus, however, on the possibility of extending our techniques towards resolving the general RL vs. L question. In this direction we obtain...

We present a deterministic algorithm for graph connectivity that uses the minimal amount of memory possible, up to a constant factor. Specifically, the algorithm's memory is comparable to that needed to store only a single node of the graph (i.e...