Past Events

I will introduce a natural geometric learning framework, the atomic cluster expansion (ACE), which focuses on linear and shallow models, and adds a new dimension to the design space of geometric deep learning. ACE is particularly well-suited for...

Malignant gliomas are highly invasive brain tumors. Recent attention has focused on their capacity for network-driven invasion, whereby mitotic events can be followed by the migration of nuclei along long thin cellular protrusions, termed tumour...

It is an open question of Baker whether the Dirichlet L-values at 1 with fixed modulus are linearly independent over the rational numbers. The best-known result is due to Baker, Birch and Wirsing, which affirms this when the modulus of the associated...

We discuss how to use spectral graph theory to count subgraphs of graphs where the subgraph counted is motivated by finite field versions of questions in geometric measure theory. One representative question is the following: Let E be a set in F_q^d...

The arboricity \Gamma(G) of an undirected graph G = (V,E) is the minimal number such that E can be partitioned into \Gamma(G) forests. Nash-Williams' formula states that \Gamma(G) = \ceil{ \gamma(G) }, where \gamma(G) is the maximum of |E_H|/(|V_H|-1...

Since Alan Turing's pioneering publication on morphogenetic pattern formation obtained with reaction-diffusion (RD) systems, it has been the prevailing belief that two-component reaction diffusion systems have to include a fast diffusing inhibiting...

In this talk, I will present a recent joint work with Yoonbok Lee, where we investigate the number of zeros of linear combinations of $L$-functions in the vicinity of the critical line. More precisely, we let $L_1, \dots, L_J$ be distinct primitive...

In the late 20th century, statistical physicists introduced a chemical reaction model called ballistic annihilation. In it, particles are placed randomly throughout the real line and then proceed to move at independently sampled velocities...

We define vertex-colourings for edge-coloured digraphs, which unify the theory of P -partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic symmetric and...

We provide a brief motivational overview of recent developments of extensions of stochastics tools to deal with uncertainty. These are: Peng's nonlinear expectations and Ito's calculus without probabilities. We then describe a non-probabilistic...