Previous Conferences & Workshops

Equivariant localization relates the geometry of a space to the geometry of the fixed points of a group action. A categorified application of this technique allows one to recover D-modules on a smooth space from coherent sheaves on its loop space...

In the past few years there has been much excitement, and many positive and negative results, regarding the computation of equilibria in games. The problem of finding Nash equilibria in games was shown intractable, there is an on-going race of...

We prove strong lower bounds for Sherali-Adams relaxations of the MAX CUT, Vertex Cover and Sparsest Cut problems. Specifically, we show that the integrality gap of MAX CUT and Vertex Cover relaxations is 2-$\epsilon$ after n^delta rounds (where...

This will be a relaxed, very elementary introduction to the central ideas and applications of derived algebraic geometry. My objective is to describe the Artin-Lurie Representability Theorem, and to give a number of interesting examples.

A sequence of primes p_1, ..., p_k is called a prime chain if p_j | (p_{j+1}-1) for each j ; e.g. 3, 7, 29, 59. We will discuss problems about counting prime chains with certain properties, and about the existence of prime chains with various...

We construct a weak representation of the category of framed affine tangles on a disjoint union of triangulated categories $D_n$. The categories we use are that of coherent sheaves on Springer fibers over a nilpotent element of $SL(2n)$ with two...

In this talk we will examine some computational problems related to polynomials, namely: (i) Given a polynomial, can we make a linear transformation on the variables and write it as the sum of two independent polynomials. (ii) Is a given set of...

A given function f(x) is "hard on average" with respect to an algorithm A , if A(x) disagrees with f(x) on "many" inputs x. Applications in cryptography and derandomization require functions that are "very hard on average" (essentially unpredictable...