Past Events

A momentous legacy of twentieth-century mathematics is the realisation that deterministically evolving systems frequently exhibit, when observed for sufficiently extended periods of time, a statistical behaviour akin to the limiting behaviour of...

Central limit theorem is a significant result in probability. It states that under some assumptions, the behavior of the average of identically distributed independent random variables tends towards that of the standard Gaussian random variable as...

Optimal transport studies the most economical movement of resources. In other words, one considers a pile of raw material and wants to transport it to a final configuration in a cost-efficient way. Under quite general assumptions, the solution to...

When the same topic appears in both mathematics and physics, there are often stark differences between how that topic is conceptualized and studied in each discipline. In this talk we will examine what it means to a physicist for a field theory to be...

Population neuroimaging is devoted to the identification and modelling of brain development, maturation and aging by using a combination of neuroimaging with epidemiology and omics sciences, as applied in large cohorts and meta-analytical datasets...

Given coprime integers $a,b$, the classical identity of Bezout provides integers $u,v$ such that $au-bv = 1$. We consider refinements to this identity, where we ask that $u,v$ are norms from a quadratic extension. We then find ourselves counting...

Families of p-adic automorphic forms are well studied objects of arithmetic geometry since the pioneering work of Hida and Coleman. Their study resulted in the definition of geometric objects, called eigenvarieties, that parametrize systems of Hecke...

The Coast Combinatorics Conference Series began in 1999. In most years there has been a meeting on the Canadian west coast in February or March, featuring a collegial, collaborative, workshop-style atmosphere and a diverse collection of talks on...

A graph is Ramsey if its largest clique or independent set is of size logarithmic in the number of vertices. While almost all graphs are Ramsey, there is still no known explicit construction of Ramsey graphs. We discuss recent progress on finding...