Simon Fraser University

This talk will focus on two topics in the foundations of neural networks: computability and false structures. In the first part I will recall briefly the concept of recursive functions and then discuss the gap between existence results, the...

Neural networks are remarkable families of non-linear functions that form the backbone for state-of-the-art algorithms in tasks from computer vision (self-driving cars), natural language processing (Google Translate) and reinforcement learning...

A challenge in descriptive complexity is to identify logics with low complexity that simultaneously express both fundamental reachability properties and counting properties on unordered structures. In this talk, we introduce a family of logics that...

A widespread approach for tsunami simulation is to model the ocean with the shallow water equations (SWE). The steady-state ocean floor deformation that results from a seismic event is often used as the initial ocean surface profile for the SWE...

We consider an aggregation model that consists of an active transport equation for the macroscopic population density, where the velocity has a nonlocal functional dependence on the density, modelled via an interaction potential. We set up the model...

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

We explore graphs of high cop number. We give new lower bounds for cop number of graphs of high girth. We also present a new class of undirected graphs with cop number $(1-o(1)) \sqrt{n/2}$ and a class of directed graphs with cop number $(1-o(1))...

Solvers for the Boolean satisfiability problem have been increasingly used to solve hard problems from many fields and now routinely solve problems with millions of variables. Combinatorial problems are a natural target, as SAT solvers contain...

On May 27, 2019, the Electronic Journal of Combinatorics, a diamond-access journal founded by the late Herb Wilf and Neil Calkin, will celebrate its 25th birthday by organizing a satellite conference in conjunction with CanaDAM 2019. There will be...

In this talk I will present the personal journey that the study of mathematics has allowed me to travel so far. It begins with a typical academic career, focused on research in applied mathematics, and specifically the mathematics related to the...