Simon Fraser University

Despite extensive research, it is not known whether Oort's conjecture about the existence of supersingular curves is true or false. In the first part of the talk, I will describe supersingular curves and discuss the status of Oort's conjecture (both...

In function approximation, it is standard to assume the availability of an orthonormal basis for computations, ensuring that numerical errors are negligible. However, this assumption is often unmet in practice. For instance, multivariate...

Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al. analyzed the behavior of PDHG when applied to an infeasible or unbounded instance...

Wiles’ famous proof of Fermat’s Last Theorem pioneered the so-called modular method, in which modularity of elliptic curves is used to show that all integer solutions of Fermat’s equation are trivial. In this talk, we briefly sketch a variant of the...

We introduce an inexact trust-region method for efficiently solving a class of problems in which the objective is the sum of a smooth, nonconvex function and nonsmooth, convex function. Such objectives are pervasive in the literature, with examples...

I will discuss various joint works with Luca Nenna and PhD student Joshua Hiew. We show that entropically regularized optimal transport with discrete marginals and general cost functions can be characterized by a well-posed ordinary differential...

Blood is a crucial life-saving product in healthcare systems. Red blood cells are perishable, and managing these stocks in British Columbia and other regions of Canada, with remote / rural hospitals is challenging. Demand must be satisfied without...

It is a well-known result of Harish-Chandra that most invariant distributions on real and p-adic reductive groups (e.g., Fourier transforms of orbital integrals, and characters of representations) are represented by locally integrable functions on...

Any construction of a quantum computer requires finding a good set of universal quantum logic gates: abstractly, a finite set of matrices in U(2^n) such that short products of them can efficiently approximate arbitrary unitary transformations. The 2...