Past Events

In this talk, I will discuss recent work in which we establish the rigidity of the Hawking mass for stable constant mean curvature spheres, addressing a problem posed by Robert Bartnik in 2002. More precisely, we demonstrate that any complete...

What constitutes a fair algorithm and the ethical use of data is context specific. Algorithms are not neutral and optimization choices will reflect a specific value system and the distribution of power to make these decisions. Data also reflect...

Let ordp(a) be the order of a in (ℤ/pℤ)∗. In 1927 Artin conjectured that the set of primes p for which a given integer a (that is neither a square number nor −1) is a primitive root (i.e. ordp(a)=p−1) has a positive asymptotic density among all...

Derivative-free optimization (DFO) methods are a class of optimization methods that do not use the derivatives of the objective or constraint functions. Model-based DFO methods are an important class of DFO methods that are known to struggle with...

In 2021, Mohar introduced the game of Cops and Robber on geodesic spaces. The game captures the behavior of the Cops and Robber game played on graphs and that of continuous pursuit-evasion games. Analogous to one of the main open problems for the...

Density functional theory (DFT) is one of the workhorses of quantum chemistry and material science. In principle, the joint probability of finding a specific electron configuration in a material is governed by a Schrödinger wave equation. But...

A symmetric monoidal category is a category equipped with a monoidal product that is uniquely commutative up to isomorphism. In this way the iterated monoidal product has an action from the symmetric groups. We can generalize this notion by allowing...

The Schensted correspondence is a bijection between permutations in Sn and pairs of standard Young tableaux (P,Q) with n boxes which have the same shape. This bijection has remarkable properties in algebraic and enumerative combinatorics. Motivated...

The KPZ (Kardar-Parisi-Zhang) universality class is a loose term for a collection of random interface growth models and random planar metrics that exhibit the same behaviour under rescaling. Examples of models in this class include TASEP, last...

The KPZ (Kardar-Parisi-Zhang) universality class is a loose term for a collection of random interface growth models and random planar metrics that exhibit the same behaviour under rescaling. Examples of models in this class include TASEP, last...