Past Events

I will talk about the `minimal spanning arborescence', a directed version of the Minimal spanning tree. I will explain how this naturally leads to a new type of stochastic process which we call `loop contracting random walk'. I will show how this can...

In this talk, we will discuss the classical problem, known as Falconer's distance problem, of quantifying the minimum amount of pairwise distances associated with a given Borel set in Euclidean space. For the last 25 years, methods in harmonic...

Advances in microscopy can now provide snapshot images of individual RNA molecules within a nucleus. Decoding the underlying spatiotemporal dynamics is important for understanding gene expression, but challenging due to the static, heterogeneous, and...

We discuss the role of long Dirichlet polynomials in number theory. We first survey some applications of mean values of long Dirichlet polynomials over primes in the theory of the Riemann zeta function which includes central limit theorems and pair...

Modern physics involves beautiful and intricate mathematics, and entirely new mathematical structures often emerge from physical theories. An example of this is the concept of Airy structures, which was first introduced by Kontsevich and Soibelman in...

Waldhausen’s S_\bullet-construction gives a way to define the algebraic K-theory space of a category with cofibrations. Specifically, the K-theory space of a category with cofibrations C can be defined as the loop space of the realization of the...

Until quite recently, many points of connection between mathematics and theoretical physics focused on so-called "twists" of supersymmetric field theories. Such twists are holomorphic or topological field theories that are amenable to rigorous...

Exponential sums play a role in many different problems in number theory. For instance, Gauss sums are at the heart of some early proofs of the quadratic reciprocity law, while Kloosterman sums are involved in the study of modular and automorphic...

In 1974 Erdős and Rothschild asked the following question: given integers k, s and a large n, what is the maximum number of s-edge-colourings of an n-vertex graph free of a monochromatic k-vertex clique? A follow up question is to determine which...

The central objects in this talk are the descent polynomials of colored permutations on multisets, referred to as colored multiset Eulerian polynomials. These polynomials generalize the colored Eulerian polynomials that appear frequently in algebraic...