Simon Fraser University

How does representation of a problem affect the complexity of solving it? What is the interplay between the richness of a domain in which a statement is expressed and the complexity of proving that statement? Not only this is a fundamental question...

We will disucss some recent advances in the convergence of Anderson acceleration, an extrapolation technique that can be applied to general fixed-point iterations. The theory will be illustrated on some examples of systems arising from finite element...

Multiplayer games model the behavior of competing agents, and we are interested in the structure that emerges when the number of agents is large. The Dyson and Coulomb games are N-agent dynamic games that admit well studied models of statistical...

A double occurrence word w is a word (sequence of letters) in which each of its letters occurs exactly twice. Legal 2-coloring of w is a colouring of individual letters such that each letter occurs once red and once blue. Our goal is to find for a...

We consider the Dirichlet problem for a strongly-coupled nonlocal system of equations motivated by peridynamics, a model in continuum mechanics. The strain energy densities involve the magnitude of projected "directional" difference quotients of the...

Low Mach number equation sets approximate the equations of motion of a compressible fluid by filtering out the sound waves, which allows the system to evolve on the advective rather than the acoustic time scale. Depending on the degree of...

In this first talk out of two, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The talk will also be an...

We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed probability...

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

This is the second of a two-part talk. In talk one, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The...