Past Events

The UBC Applied Mathematics Meeting is a one day conference dedicated to the newly created SIAM Student Chapter at UBC, Vancouver, Canada. This event aims to bring together mathematicians, industry researchers, and students to exchange ideas, present...

In this talk I will present a series of works derived from the framework of physics inspired graph neural networks (GNN). The central premise is a GNN can be seen as the discretisation of a learnable dynamical system over a graph, this allows to...

Random walks or diffusions with Dirichlet boundary condition (killing at the boundary) admit a Perron-Frobenius eigenfunction (the unique positive normalized eigenfunction when the domain is bounded). Starting with gambler's ruin problems, we discuss...

The first regularity results for maps optimizing an open class of cost were proved by Ma-Trudinger-Wang (2005) using a key inequality which they introduced (based on a classical strategy of Pogorelov). Away from the boundary, this inequality controls...

An n-by-n matrix A=[a_{ij}] is said to be a pairwise comparison matrix (PC matrix) or a reciprocal matrix if it is positive and a_ij=1/a_ji, for all i,j=1,...,n. If, in addition, a_ika_kj=a_ij for all i,j,k, the matrix is said to be consistent. There...

A ring spectrum (a.k.a. a multiplicative cohomology theory) E is complex-orientable if every complex vector bundle admits a Thom class in E . While many familiar spectra are complex-orientable, notable examples fail to be so — such as real K-theory...

For a complex projective variety, the Lefschetz standard conjectures predict the existence of algebraic self-correspondences that are inverse to the hard Lefschetz isomorphisms. They have broad implications for Hodge theory and the theory of motives...

Triangular modular curves are a generalization of modular curves and arise as quotients of the complex upper half-plane by congruence subgroups of hyperbolic triangle groups. These curves naturally parameterize hypergeometric abelian varieties...

12:30 - 1:30 PM: Lunch/Coffee/Tea/Snacks 1:30 - 1:35: Opening Remarks 1:35 - 1:50: Jonathan Hermon A simple characterization of the effective resistance metric on vertex transitive graphs The effective resistance satisfies the triangle inequality and...

The Turan density of a forbidden hypergraph F is the largest edge density a large hypergraph H can have without containing any copy of F, and determining this number for various F is a notoriously difficult problem. One on-ramp to this question (from...