Simon Fraser University

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

A skew shape is a difference of two Young diagrams where one diagram contains the other. In 2017, Jenna Rajchgot, Matthew Satriano, and Wanchun Shen showed that skew shapes can be used to study the Gerstenhaber problem, a matrix algebra problem in...

Over the past few years, operator learning – the approximation of mappings between infinite dimensional function spaces using ideas from machine learning – has attracted increased research attention. Approximate operators, learned from data, hold...

In this talk, we study the performance of some preconditioners for accelerating the convergence of Krylov subspace methods for solving linear systems of equations with a block three-by-three structure. A brief discussion is included regarding how...

TBA

There is an interesting connection between chemistry and graph theory. This connection is highlighted by the relationship between a energy of a molecule and the eigenvalues of its graph. In the 1970s, a chemist named Ivan Gutman introduced a concept...