Past Events

Date: Thursday, April 24, 2025 Time: 9:00 AM – 4:00 PM Venue: MS 431, Department of Mathematics and Statistics, University of Calgary Keynote Address by Prof. Alexandre Bouchard-Côté (University of British Columbia) Trainee Contributed Talks &...

Let K be a convex body made of material of uniform density less than 1 submerged into water of density 1. How to find the directions of equilibrium of $K$? How many directions of equilibrium does a triangular prism have? (A direction n orthogonal to...

Following a vaccine inoculation or disease exposure an immune response develops in time, where the description of its time evolution poses an interesting problem in dynamical systems. The principal goal of theoretical immunology is to construct...

Homology and cohomology are powerful invariants: while easy to compute, they contain rich information about spaces, the geometry of manifolds, vector bundles, and more. (Co)homology satisfies a list of axioms which are easy to generalize. The best...

In this talk we study interacting fermions on a discrete finite lattice subject to a homogeneous magnetic field at positive temperature. One prime example of such systems is the Hofstadter-Hubbard model. We show that the magnetization is equal to the...

Lagrangian submanifolds are a central object of study in symplectic topology. Their rigidity properties have been uncovered via Floer theory since the early ’90’s. The talk will briefly review the subject, in particular how triangulated category...

Let Mat n × n ( C ) be the affine space of n × n complex matrices with coordinate ring C [ x n × n ] . We define graded quotients of C [ x n × n ] where each quotient ring carries a group action. These quotient rings are obtained by applying the...

Recently, Sherry et al. (2024) reconsidered the pioneering work of Dahlquist and Jeltsch (1979) on circle-contractivity for the study of neural networks. This theory can be used to analyse and improve the robustness of architectures that are devised...

For many optimization problems, we lack time-efficient algorithms; in many cases this is true even for "average-case" inputs from simple data models. To what extent can tools for complexity theory be adapted to this average-case setting? In this talk...

TBA