Simon Fraser University

Every curve has an abelian variety associated to it, called the Jacobian. Poincaré's total reducibility theorem states that any abelian variety is isogenuous to a product of simple abelian varieties. We are interested to know this decomposition for...

The SFU Statistical Learning for Large Scale Data conference aims to promote the presentation and discussion on the latest progress in statistical learning for large-scale data. It empowers organizations and researchers to harness the vast amount of...

The event will be a half-day event at SFU Harbour Center, featuring three speakers: Professor Giang Tran, U. Waterloo; Associate Professor Mirands Holmes-Cerfon, UBC; and Professor Jingwei Hu, U. Washington. There will also be a poster session...

On Feb 13, J. Campion Loth gave the Discrete Math seminar on "Symmetry of Star Factorisations", where he focused on the combinatorial aspects of these objects and related factorisation problems. In this talk, we will look at these objects, which I...

Mean-field game (MFG) systems provide a powerful framework for modeling the collective behavior of multi-agent systems with diverse applications. However, unknown parameters pose challenges. In this work, we tackle an inverse problem, recovering MFG...

The annual Changing the Culture Conference, organized and sponsored by the Pacific Institute for the Mathematical Sciences, brings together mathematicians, mathematics educators and school teachers from all levels to work together towards narrowing...

The topic of this talk is on Blackbox optimization (BBO), the study of applications, attributes, and solutions of optimization problems in which the values of one or more of the functions defining the problem are provided through blackboxes. The Mesh...

Computational convex analysis aims at computing mathematical objects commonly used in convex analysis with an emphasis on lower dimensions to facilitate visualization. The latest contributions have focused on computing the closest convex function and...

In 1962, Tutte proposed a simple method to produce a straight-line embedding of a planar graph in the plane, known as Tutte's spring theorem. This construction provides not only one embedding of a planar graph, but infinite many distinct embeddings...

Given two (di)graphs $G$, $H$ and a cost function $c:V(G)\times V(H) \to \mathbb{Q}_{\geq 0}\cup\{+\infty\}$, in the minimum cost homomorphism problem, MinHOM($H$), we are interested in finding a homomorphism $f:V(G)\to V(H)$ (a.k.a $H$-coloring)...