Previous Conferences & Workshops

Come play with 250 physical wooden blocks and join us in thinking about a simple open problem for dimers in 3D. No prior knowledge required. We’ll start with an ~10 minute presentation explaining the problem and then suggest some things for everyone...

Markov numbers are positive integers that appear in solutions of the equation x^2+y^2+z^2=3xyz. They also appear naturally when one tries to parametrize positive $SL_2(R)$-local systems on a one punctured torus. In this talk I will explain that...

In this talk, we show a strong XOR lemma for bounded-round two-player randomized communication.  For a function f:X×Y→{0,1}, the n-fold XOR function f^⊕n:X^n×Y^n→{0,1} maps n input pairs (x_1,...,x_n), (y_1,...,y_n) to the XOR of the n output bits f...

We discuss new results on lozenge tilings on an infinite cylinder, which may be analyzed using the periodic Schur process introduced by Borodin. Under one variant of the q^vol measure, corresponding to random cylindric partitions, the height...

Given a set of integers, we wish to know how many primes there are in the set.  Modern tools allow us to obtain an asymptotic for the number of primes, or at least a lower bound of the expected order, assuming certain strength Type-I information...

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