Past Events

The question of whether one graph can be embedded in another is a fundamental problem in graph theory. In 2020, Joos and Kim introduced a generalization of the basic graph embedding problem to graph collections. Let $G=\{G_1,\ldots,G_m\}$ be a...

We survey some new and old, positive and negative results on a priori estimate, regularity, rigidity, and constant rank results for special Lagrangian and quadratic Hessian equations. These equations originate in calibrated, convex, conformal, and...

The UBC Mathematics-Biology research group is delighted to host four distinguished speakers from South Africa as part of the University Staff Doctoral Program: Building Capacity in Applied Mathematics (USDP-BCAM). This international collaboration...

I will present the invariance of extremal Kahler manifolds under a suitable class of bimeromorphic morphisms. Focusing mostly on the cscK (constant scalar curvature Kähler) case, I will show how the main result is obtained as a consequence of a...

One of the main goals of statistical mechanics is to understand critical phenomena of lattice models. This can be achieved by computing the so-called critical exponents, which govern algebraic scaling near or at the critical point. This task is...

We built an age- and immunity-stratified COVID-19 model with setting-specific contacts (home, school, workplace, other) and calibrated it to Ontario’s pre-Omicron incidence and hospital admissions. Counterfactuals toggled vaccination and varied NPIs...

Topic: Approximation and Our Intellectual History Abstract: Philosophers and mathematicians are lovers of truth—exact truth; in many ways, this accounts for our interwoven histories. But this is a tragic love, constantly frustrated by the elusiveness...

I shall start with reminders on congruences and p-adic numbers, then give Hasse's contribution to the local-global principle. I shall then mention counterexamples to the "Hasse principle" and then describe various ways which have been devised to...

In this talk we see how representation theory can be used in numerical methods for partial differential equations (PDEs) and how numerics can give more efficient methods for computational problems in representation theory. In particular, we will see...

The Laplacian matrix L of a signed graph G may or may not be invertible. We present an entrywise combinatorial formula for the Moore-Penrose inverse of L, obtained by deriving a combinatorial expression for the Moore-Penrose inverse of an incidence...