University of Victoria

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

Response optimization is a process of identifying the input variable settings that optimize the response. Multistratum design arises naturally in industrial experiments due to the inconvenient and impractical completely randomization. Accounting for...

Single-cell omics data play a pivotal role in identifying cell-to-cell heterogeneity, understanding cell differentiation, unveiling cell population structures, and ultimately deciphering disease pathogenesis. Due to inherent high-dimensionality...

In this talk, I will present a recent work in which two co-authors and myself studied the behaviour of a local algorithm optimizing the weight of a graph. More precisely, the process starts with a given subgraph H of the complete graph with uniform...

Turán-type problems for hypergraphs have been an intriguing area of research. Despite significant efforts, the Turán density of F is known for only a few three-uniform hypergraphs F. This talk concerns Turán-type problems for 3-uniform tight cycles C...