Simon Fraser University

Abstract: Efficient time-domain solvers for wave propagation problems must include three crucial components: i. Radiation boundary conditions which provide arbitrary accuracy at small cost (spectral convergence, weak dependence on the simulation time...

ABSTRACT: Pseudo-arclength continuation is a well-established framework for generating a curve of numerical solutions of nonlinear equations. The usual predictor-corrector scheme uses a prediction of a prescribed step-length along a tangent direction...

Abstract: Relics of early life, preceding even the last universal common ancestor of all life on Earth, are present in the structure of the modern day canonical genetic code --- the map between DNA sequence and amino acids that form proteins. The...

Abstract: Let S be a set of n = d points in general position in R^d. An oriented (d-1)-simplex spanned by d points from S is called a k-facet iff the positive side of its convex hull contains exactly k points from S. An at-most-k-facet is simply an...

Abstract:

Abstract: In this talk we discuss various colorings of the Euclidean Plane and some of its subsets. The notion of Ramsey-Type configurations is introduced and a few familiar configurations are examined to determine which of them are Ramsey-Type and...

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