Simon Fraser University

I will describe a new approach for exhaustively generating combinatorial objects by combining a satisfiability (SAT) solver with an isomorph-free exhaustive generation method such as orderly generation. The SAT solver is able to limit the search to...

Abstract polytopes are a combinatorial generalisation of classical objects that were already studied by the greeks. They consist in posets satisfying some extra axioms. Their rank is roughly speaking the number of layers the poset has. When they have...

There is a wealth of combinatorial algorithms for classical min-cost flow problems and their simpler variants like max flow or shortest-path problems. It is wellknown that several of these algorithms are intimately related to the Simplex method and...

Data science involves the collection, management, processing, analysis, visualisation and interpretation of huge amounts of data. It is a multi-disciplinary field that integrates systematic thinking, methodology, process and technology to develop...

In December 2020, Peter Scholze proposed a challenge to formally verify a theorem he and Dustin Clausen proved about the real numbers in the context of condensed mathematics, saying it might be his "most important theorem to date." I was part of the...

Given an affine space of matrices L and a matrix Θ ∈ L, consider the problem of computing the closest rank deficient matrix to Θ on L with respect to the Frobenius norm. This is a nonconvex problem with several applications in control theory...

In this talk, we consider analogs of Jaeger's circular flow conjecture and its dual Jaeger-Zhang conjecture in signed graphs. We will first give the notions of circular coloring and circular flow in signed graphs, and then show that every (6k-2)-edge...

Space-time finite element methods (FEMs) are likely to grow in popularity due to the ongoing growth in the size, speed, and parallelism of modern computing platforms. The allure of space-time FEMs is both intuitive and practical. From the intuitive...

In 3D modeling, medical imaging, and other disciplines, popular techniques for geometry processing often rely on mathematical models for surface geometry, viewing shapes as thin sheets embedded in $\mathbb{R}^3$; this construction neglects the fact...

The distance matrix of a connected graph $G$ is an $n \times n$ matrix $D(G) = [d_{ij}]$, where $d_ij$ is the distance between the vertices $v_i$ and $v_j$ . The distance spectrum of $G$ is ${\lambda_1, . . . , \lambda_n}$, where $\lambda_i$ are the...