University of Victoria

A proper conflict-free colouring of a graph is a (vertex-)colouring with no monochromatic edges such that for every nonisolated vertex v, the neighbourhood N(v) contains a vertex w coloured with a colour not appearing on N(v)-{w}. For a real number h...

For fixed n, consider the symmetric group S_n on the symbols 1,...,n and the set of *star* transpositions, the transpositions that contain the symbol n. A *star factorization* of a permutation b in S_n of length k is the writing of b as the product...

In recognition of Rod Edwards’ remarkable contributions to the field of Mathematical Modeling, we are inviting Rod’s current and former students, postdocs, close collaborators, friends and colleagues to attend this event, scheduled to take place on...

The theory of combinatorial limits, which provides analytic tools to represent and study large discrete structures, resulted in new views on a wide range of topics in mathematics and computer science and also opened new connections between...

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...

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...

Feynman’s path integral expresses the probability amplitude of a quantum mechanical system as a “sum of trajectories” of the classical system. Since this integral has not been given a satisfactory mathematical meaning, a widely accepted treatment is...

The Lorentz gas was originally introduced as a model for the movement of electrons in metals. It consists of a massless point particle (electron) moving through Euclidean space bouncing off a given set of scatterers $\mathcal{S}$ (atoms of the metal)...

In 2021, Mohar introduced the game of Cops and Robber on geodesic spaces. The game captures the behavior of the Cops and Robber game played on graphs and that of continuous pursuit-evasion games. Analogous to one of the main open problems for the...

Given two graphs H and G, the homomorphism density t(H,G) represents the likelihood that a random mapping from V(H) to V(G) is a homomorphism. Sidorenko Conjecture states that for any bipartite graph H, t(H,G) is greater or equal to t(K_2,G)^{e(H)}...