Simon Fraser University

Computational modelling can be used to reveal insights into the mechanisms of new drugs and to develop new diagnostic tools. Here I will discuss three major diseases: diabetes, hypertension, and autism. I will talk about how we construct models to...

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

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

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

Tree structures emerge in various sciences. It is challenging to compare and analyze tree structures as both the size and the number of trees are increasing and there are few tools to describe tree structures in a quantitive, accurate, comprehensive...

The celebrated Erdős-Pósa theorem states that every undirected graph that does not admit a family of k vertex-disjoint cycles contains a feedback vertex set (a set of vertices hitting all cycles in the graph) of size O(k log k). After being known for...

The dimension of a poset P is the minimum number of total orders whose intersection is P. We prove that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta log^{1+o(1)} \Delta$. This result improves...

Results on a two way convection-diffusion problem; an asymptotic error analysis on a piece-wise uniform grid; and a framework for understanding quadrature errors in Finite Element Methods are presented. These results were never published, although I...

Borcherds won the Fields medal in 1998 for his proof of the Monstrous Moonshine Conjecture. Loosely speaking, the conjecture asserts that the representation theory of the Monster, the largest sporadic finite simple group, is dictated by the Fourier...