Simon Fraser University

The defining property of fine moduli stacks (of curves) is that they have 'universal families' which translates the study of a family of (curves) as the study of morphisms to moduli stacks. I will explain this idea using Hom_{n}(P^1, Mbar_{1,1}) the...

The Coast Combinatorics Conference Series began in 1999. In most years there has been a meeting on the Canadian west coast in February or March, featuring a collegial, collaborative, workshop-style atmosphere and a diverse collection of talks on...

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

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

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

We will characterize members that maximize/minimize the second largest adjacency eigenvalue in certain families of trees. Joint work with H. Kumar, B. Mohar and S. Pragada.

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

TBA

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