Simon Fraser University

This seminar is cancelled and will be scheduled for a later date. In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction...

Let G=(V,E) be an undirected graph on n vertices and λ:E →2^N a mapping that assigns to every edge a non-empty set of positive integer labels. These labels can be seen as discrete times when the edge is present. Such a labeled graph G'=(G,λ) is said...

Integer programming is one of the most fundamental problems in discrete optimization. While integer programming is computationally hard in general, there exist efficient algorithms for special instances. In particular, integer programming is fixed...

What is a game? Mathematically speaking, a game has players, strategies and scores to explain why the players win or lose. Games which are modelled with differential equations are called differential games. Common examples are pursuit-evasion games...

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

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

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

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

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