Simon Fraser University

Abstract: I will introduce the notion of stabilizer quantum error correcting codes and perfect quantum secret sharing schemes. Then I will illustrate how, using any given stabilizer code, one can always construct a perfect quantum secret sharing...

Abstract: In 1976 Helleseth proposed a beautiful conjecture that connects number theory (Weil sums of binomials), sequence design (cross-correlation of maximum-length sequences), coding theory (weights in sums of irreducible cyclic codes)...

Abstract: One of the fundamental properties of word equations isthe following compactness result: each system of word equation with a fixed finite number of unknowns is equivalent to some of its finite subsystems. Or equivalently there does not exist...

Abstract: Let $D \\subseteq \\mathbb{Z}^+$. For $r \\in \\mathbb{Z}^+$, we say the $D$ is {\\it $r$-large} if every $r$-coloring of the positive integers admits an arbitrary long monochromatic arithmetic progression with common difference from $D$...

Abstract: Simulation experiments are used throughout the sciences to make model comparisons, predict future events, and lobby for particular hypotheses or metholodogies. Simulations can transform subjective design decisions into seemingly objective...

The Mitacs-PIMS-SFU Summer School for Undergraduates in Algebraic Graph Theory is an intensive program for Canadian and International students. The core of the program is a course which provides a thorough introduction to the interaction between...

Frontiers in Biophysics 2012 is a one-day scientific event intended to highlight the research interests of the physical biology, chemical biology, biophysics, and mathematical biology communities from SFU, UBC and other local institutions...

The UBC Statistics Department and the SFU Statistics and Actuarial Science Department jointly host one seminar per term at a central location in Vancouver. These seminars are intended to be informal, and at a level accessible to graduate students...

Abstract: Let ne(G) be the maximum number of vertex-disjoint odd cycles of a graph G and ta(G) the minimum number of vertices whose removal makes G bipartite. We show that ta(G) ≤ 6ne(G) if G is planar. This improves the previous bound ta(G) ≤ 10ne(G...

Abstract: In this talk we consider spy agents , a means for evaluating trust in remote hosts in mobile code scenarios. A spy agent, i.e. a mobile agent which circulates amongst anumber of remote hosts, can employ a variety of techniques to disguise...