Past Events

Shortcut graphs are graphs in which long enough cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly broad family of graphs and groups of...

A directed graph H consists of a set V(H) of vertices together with a subset A(H) of V(H)×V(H) which are called arcs. A hamiltonian dipath in a digraph is a dipath that visits each vertex exactly once. The Cartesian product H 1◻H 2 of two digraphs H...

Recursive distributional equations (RDEs) are ubiquitous in probability. For example, the standard Gaussian distribution can be characterized as the unique fixed point of the following RDE $$ X = (X_1 + X_2)/\sqrt(2), $$ among the class of centered...

Increasing equity, diversity and inclusion in science, technology, engineering and math. Join us for a conversation with Julie Angus, Open Ocean Robotics, Mina Hoorfar, UVic Engineering and Computer Science, Sue Paish, Canada’s Digital Technology...

In this talk, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also discuss the linear local matching...

How roots of a polynomial evolve under repeated differentiation is a classical question, which goes back to Gauss, Lucas, Marcel Riesz and many others. The dynamics can be described by a partial differential equation, formally derived by Stefan...

Let G be a finite group acting transitively on X. We say g, h ∈ G are intersecting if gh -1 fixes a point in X . A subset S of G is said to be an intersecting set if every pair of elements in S intersect. Cosets of point stabilizers are canonical...

Joint work with Christophe Garban. The discrete Coulomb gas is a model where an integer amount of charged particles are put on the $d$-dimensional grid. In this talk, I will discuss the basic properties of the Coulomb gas, its connection with other...

Richard Guy's book "Unsolved Problems in Number Theory" was one of the first mathematical books I owned. I will discuss a selection of my favorite problems from the book, together with some of the progress that has been made on them in the 30 years...

In pursuit-evasion games, a set of pursuers attempts to locate, eliminate, or contain an evader in a network. The rules, specified from the outset, greatly determine the difficulty of the questions posed above. For example, the evader may be visible...