Previous Conferences & Workshops

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...

The presence of branch points and so-called density gaps heavily complicates the regularity theory for minimal submanifolds or, more precisely, stationary integral varifolds. Density gaps illustrate a mismatched symmetry between nearby varifolds...

A discrete subgroup of PSL(2,C) is called a Kleinian group. I will present  a criterion on  when a discrete faithful representation of a Kleinian group into PSL(2,C) is a conjugation, or equivalently  a criterion on when an equivariant embedding of...

In this talk I will first review some basics about communication complexity.  Secondly I will survey some (old and new) equivalences between central problems in communication complexity and related questions in additive combinatorics.  In particular...

Projective modules over rings are the algebraic analogs of vector bundles; more precisely, they are direct summands of free modules. Some rings have non-free projective modules. For instance, the ideals of a number ring are projective, and for some...

In this talk, I'll discuss a recent result where we settle the complexities of the maximum-cardinality bipartite matching problem (BMM) up to poly-logarithmic factors in five models of computation:  The two-party communication, AND query, OR query...

It all began with card shuffling. Diaconis and Shahshahani studied the random transpositions shuffle; pick two cards uniformly at random and swap them. They introduced a Fourier analysis technique to prove that it takes $1/2 n \log n$ steps to...

Lévy matrices are symmetric random matrices whose entries are in the domain of attraction of an \alpha stable law. For \alpha 1, it had been predicted that these matrices exhibit an Anderson transition, also called a mobility edge, a point in the...