Simon Fraser University

Abstract: We consider the aggregation equation \rho_t = \nabla\cdot(\rho \nabla K*\rho) in R^n, where the interaction potential K models short-range singular repulsion and long-range power-law attraction. Here, \rho represents the density of the...

Abstract: We will describe a few new developments creating a new class of DPG (discontinuous Petrov Galerkin) methods. These methods use spaces that yield stability constants that are optimal or close to optimal. Since stability of DPG methods come...

Abstact: We will describe a few new developments creating a new class of DPG (discontinuous Petrov Galerkin) methods. These methods use spaces that yield stability constants that are optimal or close to optimal. Since stability of DPG methods come...

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