Previous Conferences & Workshops

I will discuss random walks on manifolds and pose questions of stiffness and rigidity of stationary measures.  In the case of conservative random walks, I will discuss criteria that guarantee stiffness of stationary measures and certain rigidity...

Can we encode data in a way that it is recoverable even when 1) most data becomes corrupted, and 2) we can only read a sub-constant fraction of the database? This is the central question of local list decoding, a powerful tool from coding theory...

$p$-adic character varieties are rigid analytic moduli spaces of $p$-adic representations of fundamental groups. For curves, I will explain how these varieties lead to a non-abelian generalisation of the $p$-adic Hodge-Tate decomposition, by way of...

Langlands, inspired by his work on classification of representations of real groups, initiated a program of classifying representations of certain topological groups associated to reductive groups in terms of Langlands parameters. In the recent...

A conjecture of Komlós states that the discrepancy of any collection of unit vectors is $O(1)$, i.e., for any matrix A with unit columns, there is a vector x with -1,1 entries such that $|Ax|_\infty = O(1)$. The related Beck-Fiala conjecture states...

2:00 pm Talk(Seyfaddini): The algebraic structure of various groups of homeomorphisms and diffeomorphisms was studied extensively in the 1960s and 1970s, when it was shown that these groups are (mostly) simple. A notable open case concerned the...

11:00 am Talk(Cristofaro-Gardiner): Recently, a number of formulas reminiscent of Weyl's law have been discovered in the context of symplectic geometry. Various three-manifold invariants, defined by building on ideas originating in Morse theory...

A surprising property of the cohomology of locally symmetric spaces is that Hecke operators can act on multiple cohomological degrees with the same eigenvalues. In a series of papers, Venkatesh and his collaborators proposed an arithmetic reason for...

In this talk, I’ll describe one of the most surprising algorithms in computer science: a way to count arbitrarily high while maintaining just three bits of state and a clock. It turns out that the main idea behind the algorithm also appears in a...