Previous Conferences & Workshops

Cut problems are fundamental to combinatorial optimization, and they naturally arise as intermediate problems in algorithm design. The study of cut problems is inherently connected to the dual notion of flows. In particular, starting with the...

We introduce and construct the "AC geometry" from the Gaussian free field and use it to prove various facts about Schramm-Loewner evolutions. 

Decomposition and modularity are fundamental issues in many fields, including mathematics, biology, engineering, and management. How can large systems be broken into subsystems which interact enough to meet the overall system goals, but not so much...

Random band matrices have been proposed as an effective, or toy, model for a disorder induced localization-delocalization transition of eigenstates. Most results about these matrices, and the transition, are based on numerics or on calculations with...

We will discuss the ideas of the proof of the finite generation theorem, by looking at several special cases.

I will attempt to summarize the results in the following two papers, jointly written with R. Kottwitz and R. MacPherson: "Equivariant cohomology, Koszul duality, and the localization theorem" (Inv. Math., 1998) and "Homology of affine Springer...

Weyl group multiple Dirichlet series are multiple Dirichlet series in several variables whose coefficients involve Gauss sums and also reflect the combinatorics of a given root system. The earliest examples came from Mellin transforms of metaplectic...