Simon Fraser University

Abstract The monograph Singular Integral Equations by N.I. Muskhelishvili was published originally in Russian in 1946 and was revised and trans­lated into English in 1958. In this monograph, the solution of the Dirichlet problem is expressed in terms...

Abstract: Let D=(V,A) be adigraph. A subset K of V is k-indepenent if the (directed) distance betweenevery pair of vertices in K is at least k, we say that K is l-absorbent ifevery vertex not in K reaches a vertex in K at distance at most l and we...

The Mathematics Department at Simon Fraser University is pleased to present Computational Math Day 2012 (CMD 2012), which will be held on Wednesday, August 8th, 2012 at the IRMACS Centre, SFU Burnaby Campus. This annual event showcases the...

Abstract A frequent problem in forecasting fog or icy roads in a numerical weather prediction system is attributed to the misinterpretation of the boundary layer structure in the assimilation procedure. Case studies showed that much of the...

Abstract: Santos' recent construction of a counterexample to the Hirsch conjecture highlights a particular 5-dimensional ``prismatoid'' polytope.We use the Euler characteristicto prove that there is no analogous 4-dimensional prismatoid. This is...

Petr Škoda Abstract:We study the obstructions (minor-minimal forbidden graphs) for orientable surfaces that have a 2-vertex cut. The building blocks of the obstructions are described. As a consequence, the complete list of 68 obstructions for the...

Abstract: The graph isomorphism (GI) problem asks if two given graphs are isomorphic or not. That is, it asks there exists a one-to-one mapping between two given graphs. The GI problem is quite basic, but it's time complexity isa long standing open...

Abstract: Garg Vazarani and Yannakakis showed that the integrality gap for (the natural LP relaxation of) maximum disjoint paths (MEDP) in planar graphs is $\\Omega(\\sqrt{n})$. Noting that their gap example (a grid minor) all but disappears if edge...

Abstract: An \\emph{intertwine} of two graphs $G$ and $H$ is a graph that has both $G$ and $H$ as a minor and is minor-minimal with this property. In 1979, Lov\\'{a}sz and Unger conjectured that for any two graphs $G$ and $H$, there are only a finite...

Abstract: The body-centered cubic (BCC) lattice is the optimal three-dimensional sampling lattice. Its optimality stems from the fact that its dual, the face-centered cubic (FCC) lattice, achieves the highest sphere-packing efficiency. In order to...