Past Events

We will talk about the ideal $J$ generated by antisymmetric polynomials in two sets of variables and its powers, and discuss how these Haiman ideals are connected to link homology, geometry, and other combinatorial objects of interest. We will then...

Equivariant operads provide a powerful framework for encoding homotopic algebraic structures hidden in the non-equivariant setting, specifically those incorporating norm and transfer maps. These structures are organized by combinatorial objects...

Join us as we survey five years of progress on the distribution of mass in high-dimensional convex bodies and probability distributions. This talk explores how convexity assumptions provide a powerful alternative source of regularity in high...

In this metamathematical talk I shall argue that we genuinely belong under one roof: that no matter how we self-identify, in an important sense we all do the same thing. Recent developments have made the question "what is it that we do?" even more...

An association scheme X on a finite set V is a highly-regular partition of the edge set of the complete graph on V. The Terwilliger algebra $T_v$ of X with respect to a vertex $v\in V$ is an algebra defined using the neighbours of v in each graph in...

The recent striking developments in artificial intelligence underscore the idea that we need to (a) understand better what goes on inside neural networks, (b) thereby gain more control over them and (c) develop methods that are less expensive and...

At this point we have two cohomology theories in hand – HZ (singular cohomology) and KU (complex K-theory) – and the Chern character ch establishes a comparison between them. Even the first properties of ch can already give rise to interesting...

An (m,n)-mixed graph consists of colored edges and colored arcs. MacGillivray and Trey extended Moon’s idea of a k-universal target graph to (m,n)-mixed graphs. In particular, they constructed an (m,n)-mixed graph H such that every (m,n)-mixed graph...

A network of interacting qubits, usually subatomic particles, can be modelled by a connected weighted undirected graph G. A quantum walk on G is a deterministic process that describes the propagation of quantum states in the network represented by G...

When novel environments cause population decline, evolution can reverse this decline (“evolutionary rescue''; ER). Examples of ER include hosts adapting to novel pathogens that could otherwise lead to extinction and vice versa, (and perhaps more...