Past Events

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

The optimal transport problem provides a fundamental and quantitative way to measure the distance between probability distributions. Recently, it has been successfully used to analyze the evolutionary dynamics in physics and biology. Motivated by...

A discrete quantum walk usually takes place on the arcs of a graph. Each step of the walk consists of two operations - a "coin flip" and an "arc shift". In this talk, we will consider quantum walks where the "arc shift" simply reverses each arc...

Fusion rings are a special class of associative unital rings with nonnegative integer structure constants and a notion of duality. For example, the group ring of a finite group is a fusion ring. We study fusion rings mainly because they arise as...

Any translation surface can be presented as a collection of polygons in the plane with sides identified. By acting linearly on the polygons, we obtain an action of GL(2,R) on moduli spaces of translation surfaces. Recent work of Eskin, Mirzakhani...

Any translation surface can be presented as a collection of polygons in the plane with sides identified. By acting linearly on the polygons, we obtain an action of GL(2,R) on moduli spaces of translation surfaces. Recent work of Eskin, Mirzakhani...

Abstract : Colour {1,..,N} red and blue, in such a manner that no 3 of the blue elements are in arithmetic progression. How long an arithmetic progression of red elements must there be? It had been speculated based on numerical evidence that there...

The dimer model is the study of the set of dimer configurations (or perfect matchings) of a graph. In this talk, I will begin with an overview of the combinatorics of the dimer model, highlighting surprising connections between the dimer model and...

Establishing inequalities among graph densities is a central pursuit in extremal graph theory. One way to certify the nonnegativity of a graph density expression is to write it as a sum of squares or as a rational sum of squares. In this talk, we...