Simon Fraser University

In this overview talk, I will present the encounter-based approach to diffusive processes in Euclidean domains and highlight its fundamental relation to the Steklov spectral problem. So, the Steklov eigenfunctions turn out to be particularly useful...

Let $f(x)$ be a separable polynomial with rational number coefficients. In this talk I will review how the rational points of the hyperelliptic curve $y^2 = f(x)$ can sometimes be determined using the number field obtained by adjoining a root of $f$...

In recent years, classical knowledge-driven approaches for inverse problems have been complemented by data-driven methods exploiting the power of machine and especially deep learning. Purely data-driven methods, however, come with the drawback of...

In 1770 Euler observed that $3^3+4^3+5^3=6^3$ and asked if there was another perfect power that equals the sum of consecutive cubes. This captivated the attention of many important mathematicians, such as Cunningham, Catalan, Genocchi and Lucas. In...

Classically, Dieudonné theory offers a linear algebraic classification of finite group schemes and p-divisible groups over a perfect field of characteristic p>0. In this talk, I will discuss generalizations of this story from the perspective of p...

In this talk, we will investigate the acoustic transmission eigenvalue problem associated with an inhomogeneous media with a conductive boundary. These are a new class of eigenvalue problems that are not elliptic, not self-adjoint, and non-linear...

In my talk I will discuss the notion of local volume for singularities. For the special case of toric singularities this turns out to be closely related to the notion of Mahler volume in convex geometry. This opens a connection between algebraic...

This talk introduces a newly developed computational method for rigorously evaluating the Hadamard derivative of Laplacian eigenvalues, which plays an important role in studying shape optimization problems. To evaluate the Hadamard derivative, this...

We consider the algorithmic problem of the functional decomposition of sparse polynomials. For example, (very) given a very high degree (5∗2 100)(5∗2 100) and very sparse (7 terms) polynomial like f(x)=x(5∗2 100)+15∗x(2 102+2 47)+90∗x(2 101+2 100+2...

A classical problem in linear algebra is to understand what are the linear subspaces of the space of $m\times n$ matrices such that no matrix in the space has full rank. This problem has connections to theoretical computer science, more precisely...