Past Events

There is an interesting connection between chemistry and graph theory. This connection is highlighted by the relationship between a energy of a molecule and the eigenvalues of its graph. In the 1970s, a chemist named Ivan Gutman introduced a concept...

Students of grades 5 to 7 are invited to challenge and develop their thinking and creativity skills at the Math Circle Workshops. This is an enrichment program for students organized by the faculty members of the Department of Mathematics at the...

A technique for efficiently describing surfaces was developed to solve the knot recognition problem. This method, using “normal surfaces”, was introduced by Kneser and applied to topological algorithms by Haken. In this talk we will show how normal...

Methane's short lifespan, high Global Warming Potential, and high anthropogenic emissions level make it the most potent greenhouse gas in terms of rapidly reducing global warming. The oil and gas sector is the most significant contributor to methane...

Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. We summarize several recent efforts to...

Equivariant elliptic cohomology generalizes from equivariant cohomology and equivariant K-theory. It has a rich structure and connections to quantum groups, mathematical physics, enumerative geometry, and algebraic combinatorics. Recently, Okounkov...

Translational tiling is a covering of a space (such as Euclidean space) using translated copies of one building block, called a "translational tile'', without any positive measure overlaps. Can we determine whether a given set is a translational tile...

Using representations of functional data can be more convenient and beneficial in subsequent statistical models than direct observations. These representations, in a lower-dimensional space, extract and compress information from individual curves...

Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at a minimal cost. Originally this game was conceived as a one-player game, but later a two-player version was devised in...

In this talk I will discuss recent work resolving Buchi's problem, which has implications for Hilbert's Tenth Problem. In particular, we show that if there is a tuple of five integer squares (x12,x22,x32,x42,x52)(x12​,x22​,x32​,x42​,x52​)xi+22−2xi+12...