Simon Fraser University

In his seminal work on modular curves and the Eisenstein ideal, Mazur studied the existence of congruences between certain Eisenstein series and newforms, proving that Eisenstein ideals associated to weight 2 cusp forms of prime level are locally...

In this talk, we will study the mean field limit of weakly interacting diffusions for confining and interaction potentials that are not necessarily convex. We explore the relationship between the large N limit of the constant in the logarithmic...

Motivated by an application in the routing of technicians at a French public utility, we introduce a highly efficient heuristic together with a branch-price-and-cut algorithm for the doubly open park-and-loop routing problem. This problem is an...

TBA

At the heart of many problems in Commutative Algebra and Algebraic Geometry is the difference between symbolic and regular powers of a homogeneous ideal. One way to find failures of containments between these powers is to use an asymptotic approach...

I will describe a new approach for exhaustively generating combinatorial objects by combining a satisfiability (SAT) solver with an isomorph-free exhaustive generation method such as orderly generation. The SAT solver is able to limit the search to...

First example of applying tensor optimization to combinatorial problems was shown in IPCO 1992: pages 406-420. We improve and strengthen those results in several ways and obtain computational results on three problems – graph partitioning...

The pandemic placed considerable stress on the critical care system in British Columbia. In this talk, I will present simulation modelling analysis done to support the response to the pandemic and ongoing work to improve the ability of the critical...

Although my talk is arguably about machine-learning, I will use mostly ideas and language from mathematical modelling and numerical analysis. I will introduce a natural geometric learning framework, the atomic cluster expansion (ACE), which focuses...

In this talk we consider the injective chromatic index and the oriented chromatic number of graphs with bounded Euler genus. In particular, we present our proofs of a tight (up to the choice of little o(1)) bound on the injective chromatic index in...