The Department of Mathematics at SFU hosts annual Summer Meetings on Computational Mathematics.
The 2014 SFU Symposium on Mathematics and Computation is a showcase of research in computational mathematics at SFU, UBC, and UVic.
Program Schedule
Date: Wednesday, August 6th, 2014
Location: The IRMACS Centre, Simon Fraser University
Time  Event or Speaker  Title of Talk 

9:00am  Registration and Welcome Coffee 

9:30am  Ben Adcock (SFU) 
Getting more from less: compressed sensing and its applications 
10:15am 
Stephanie van Willigenburg (UBC)  
11:00am  Morning Coffee and Poster Setup  
11:15am  Poster Competition and Judging  
12:15pm  Buffet Lunch 

1:15pm  Chris Sinclair (Oregon)  Mathematics in the computer age: exploration and exposition 
2:00pm  Greg Mori (SFU) 
Discriminative Latent Variable Models for Human Action Recognition 
2:45pm  Afternoon Coffee  
3:00pm  Andrew King (DWave)  Working with the DWave quantum computer: Modeling, minors, and mitigation 
3:45pm  Award Ceremony  Awards for Putnam participants, Undergraduate Research Prize recipients, and Poster Prizes. 
4:15pm  Poster Presentations by Award Winners  
4:30pm  Closing Remarks 
Ben Adcock
Getting more from less: compressed sensing and its applications
Many problems in science and engineering require the reconstruction of an object  an image or signal, for example  from a collection of measurements. Due to time, cost or other constraints, one is often limited by the amount of data that can be collected. Compressed sensing is a mathematical theory and set of techniques that aim to enhance reconstruction quality from a given data set by exploiting the underlying structure of the unknown object; specifically, its sparsity. In this talk I will commence with an overview of some main aspects of standard compressed sensing. Next, motivated by some key applications, I will introduce several generalizations. First, I will show that compressed sensing is possible, and can in fact has some substantial benefits, under substantially relaxed conditions than those found in the standard setup. Second, time permitting, I will show that compressed sensing  whilst primarily a theory concerning finitedimensional vectors  can also be extended to the infinitedimensional setting, thus allowing accurate recovery of functions from small and incomplete data sets.
Andrew King
Working with the DWave quantum computer: Modeling, minors, and mitigation
The DWave Two (tm) is a quantum annealing processor consisting of 512 qubits operating at a temperature of 1020 millikelvin. Its native operation finds a lowenergy spin configuration in the Ising model on a fixed nonplanar graph. In this talk I will give an overview of the system from a mathematician's perspective. Burning issues I will explore include quantumness, minorembedding, error modeling, and upcoming developments.
Greg Mori
Discriminative Latent Variable Models for Human Action Recognition
Developing algorithms to interpret scenes of human activity involves a number of related tasks including human detection, tracking, and action recognition. These tasks are intertwined, information from one can provide assist in solving others. In this talk we will describe discriminative latent variable models to address these tasks together, focusing on the latent SVM / maxmargin hidden conditional random field. We will review work a broad swath of work in this area. These methods can be used for jointly recognizing actions and spatiotemporally localizing them in videos. Models for humanhuman and humanobject interactions will be presented. We will present methods for group activity recognition, with holistic analysis of entire scenes of people interacting and taking different social roles.
Chris Sinclair
Mathematics in the computer age: exploration and exposition
Mathematics is the study of provably true statements reachable using logic from an agreed upon set of assumptions. And, while the set of tools we use to prove statements has been largely static for the last few centuries, how we decide what to prove and how to share it with our students/colleagues/etc has undergone a remarkable transformation since the invention of the electronic computer. In this talk, I’ll demonstrate some phenomenon/patterns which are immediately apparent given a computer, and which without would probably have remained hidden from us. These examples give way to some very interesting (and applicable) mathematics, some of which I’ll try to explain. I’ll also talk a bit about how one might use new computerbased tools to share and explain new (or even old!) mathematics. So far, mathematicians have held on to linear modes of communication such as articles, books, etc, and while such things are unlikely to ever disappear, they don’t accurately reflect the true nature of mathematics as a body of knowledge (which is not a single linear progression of ideas, but a complicated highly connected graph), nor do they have the dynamic capacity to demonstrate the “doing" of mathematics. I wish to open a dialog about how modern computerbased tools can tackle the inherent nonlinearity of mathematics in such a way as to open the beauty and applicability of mathematics to a wider section of humanity.
Stephanie van Willigenburg
Quasisymmetric refinements of Schur functions
Schur functions were introduced early in the last century with respect to representation theory, and since then have become important functions in other areas such as combinatorics and algebraic geometry. They have a beautiful combinatorial description in terms of diagrams, which allows many of their properties to be determined.
These symmetric functions form a subalgebra of the algebra of quasisymmetric functions, which date from the 1980s. Despite this connection, the existence of a natural quasisymmetric refinement of Schur functions has been considered unlikely.
However, in this talk we introduce quasisymmetric Schur functions, which refine Schur functions and many of their properties, as revealed by extensive computergenerated data.
This is joint work with Christine Bessenrodt, Jim Haglund, Kurt Luoto, Sarah Mason, Ed Richmond and Vasu Tewari.
The talk will require no prior knowledge of any of the above terms.
The SFU Mathematics Department invites undergraduate and graduate research students to participate in the 2014 SFU Symposium on Mathematics and Computation Poster Competition. Postdocs and faculty may also present a poster but are not eligible for the competition.
The only requirement is that the poster has mathematics in it. It may be applied, pure, computational or experimental mathematics. If you have already prepared a poster for a presentation at another scientific meeting this year, and you would like to present it to members of the Department, this is an appropriate venue. If you wish to present a computer demo this is also possible.
There will be one prize of $200 (winner) and one prize of $100 (runnerup) for the best undergraduate poster, and one prize of $200 (winner) and one prize of $100 (runnerup) for the best graduate poster. Judging will be based on both content and presentation.
Poster titles must be submitted via the online registration form by July 31st, 2014. Presenters are responsible for printing their own poster.
The posters will be displayed in the IRMACS atrium. Poster presenters can set up their posters as early as 9:00am on August 6th, 2014. The poster and demo session will take place from 11:15am to 1:15pm. Awards will be made at 4:30pm, followed by a presentation of the winning undergraduate and winning graduate poster.
Poster Title  Affiliation  Name 

The 2013 SFU Symposium on Mathematics and Computation was a showcase of research in computational mathematics at SFU, UBC, and UVic.
Program Schedule
Date: Wednesday, August 7th, 2013 Location: The IRMACS Centre, Simon Fraser University
Time  Event or Speaker  Title of Talk 

9:00am  Registration and Welcome Coffee 

9:30am  Lily Yen (Capilano) 
Automation for the generating series of coloured set partitions 
10:15am 
Pavol Hell (SFU)  
11:00am  Morning Coffee and Poster Setup  
11:15am  Poster Session and Judging  
12:15pm  Buffet Lunch 

1:15pm  Alexandre BouchardCôté (UBC)  Inference algorithms for continuous time Markov chains over large state spaces 
2:00pm  Roberto Armenta (SFU) 
HighOrder FiniteDifference Methods for Modelling Electromagnetic Wave Propagation 
2:45pm  Afternoon Coffee  
3:00pm  Robert Bridson (UBC)  Simulating Smoke without Volumes 
3:45pm  Award Ceremony  Awards for Putnam participants, Undergraduate Research Prize recipients, Operations Research Team Award, and Poster Prizes. 
4:15pm  Poster Presentations by Award Winners  
4:30pm  Closing Remarks 
HighOrder FiniteDifference Methods for Modelling Electromagnetic Wave Propagation
Finitedifference methods are a popular choice for solving systems of partial differential equations (PDEs) numerically. Throughout my work, I employ finitedifference methods to solve the various systems of PDEs that arise in common electromagnetic problems. One of the most important recent developments in finitedifference methods has been the use of finitedifference approximations with an increasable order of accuracy. The ability to increase the order of accuracy of the employed approximations can considerably improve performance; however, to exploit highorder approximations effectively, it is necessary to clearly understand how to incorporate boundary conditions. This issue, which stands as the biggest barrier to the widespread adoption of highorder methods, will be the subject of the talk.
Simulating Smoke without Volumes
In computer graphics, and visual effects in particular, smoke simulation has become a standard tool. Typically it is modeled with incompressible fluid flow on a 3D grid, tracking soot concentration and velocity in the air, and calculating buoyancy and pressure forces to evolve it forward; volume renderers can take the soot concentration as input to produce the final images. However, this doesn't scale very well, particularly to realtime applications like video games where even the volume rendering alone is unacceptably expensive relative to the rest of the application. This calls for a little more mathematical analysis and algorithmic creativity! In many circumstances, we can model the soot concentration as uniformly smoky inside a region sharply bounded by a dynamically evolving surface; vorticity likewise provides a much more efficient representation of the velocity field. Avoiding any use of volume data, we can get to interactive simulation and highly efficient realtime rendering.
Inference algorithms for continuous time Markov chains over large state spaces
Continuous time Markov chains (CTMCs) is a fundamental modeling tool in time series analysis, phylogenetics and many other areas of statistics. In most applications, simplifying assumptions are typically made to reduce the state space of the CTMCs to a finite and typically small collection of objects (in phylogenetics, for example, the four nucleotides). However, new questions and new data types motivate the development of CTMCs over strings, graphs and other countably infinite spaces. In this talk, I will describe some of our recent work on models and algorithms for analyzing CTMCs over countably infinite space. The first part of the talk will be devoted to the Poisson Indel Process, a model for stringvalued CTMCs, and the second part, on inference on CTMCs over other countably infinite spaces. I will focus on applications in phylogenetics, but many of the algorithms and models have potential uses in other branches of applied statistics.
Combinatorial dichotomy classifications
In classifying the complexity of certain homomorphism problems, it sometimes turns out that it is the presence of a combinatorial obstruction in the target structure that causes a problem to become intractable. I will discuss several recent results of this type, including recent joint work with Egri, Larose, and Rafiey.
Automation for the generating series of coloured set partitions
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The enumeration of such objects according to their crossing or nesting number has been a challenge, often resulting in hard to solve functional equations. When both nesting and crossing numbers are bounded, the generating series are rational for (arc)colouredmatchings, set partitions, and permutations shown by Chen and Guo, Marberg, and Yen respective. We describe algorithms implemented in Maple that give the rational generating series for noncrossing, nonnesting, ccoloured set partitions and permutations. The success of the implementation leads to the possibility of automation for more complicated structures and provides new directions of attack for previously unsolved functional equations.
The SFU Mathematics Department invites undergraduate and graduate research students, postdoctoral fellows and faculty members to participate in the 2013 SFU Symposium on Mathematics and Computation Poster Session.
The only requirement is that the poster has mathematics in it. It may be applied, pure, computational or experimental mathematics. If you have already prepared a poster for a presentation at another scientific meeting this year, and you would like to present it to members of the Department, this is an appropriate venue. If you wish to present a computer demo this is also possible.
There will be one prize of $200 (winner) and one prize of $100 (runnerup) for the best undergraduate poster, and one prize of $200 (winner) and one prize of $100 (runnerup) for the best graduate poster. Judging will be based on both content and presentation.
Poster titles must be submitted via the online registration form by August 1st, 2013. Presenters are responsible for printing their own poster.
The posters will be displayed in the IRMACS atrium. Poster presenters can set up their posters as early as 9:00am on August 7th, 2013. The poster and demo session will take place from 11:15am to 1:15pm. Awards will be made at 4:30pm, followed by a presentation of the winning undergraduate and winning graduate poster.
Name  Affiliation  Poster Title 

Graham Banero  SFU  Additive Complexity of Infinite Words 
Graham Moore  Simon Fraser University  Mathematical Modelling of Sap Flow 
Ice  where he argues that Darth vader is good, and Kenobi and yoda are in fact the evil ones."I wonder how Mencius would respond to Brin's raging prsesgsoivirm since he fervently attacks LOTR for its romanticism, which is integral to all reactionary thought.  where he argues that Darth vader is good, and Kenobi and yoda are in fact the evil ones."I wonder how Mencius would respond to Brin's raging prsesgsoivirm since he fervently attacks LOTR for its romanticism, which is integral to all reactionary thought. 
Jeremy J. Chiu  Simon Fraser University  Thermoregulation of Honeybees 
Layla Trummer  NSERC USRA, Dept of Mathematics, Simon Fraser University  Algorithms for the Minimum Distance of Linear Codes 
Lee Safranek  SFU  Diffusion Geometry 
Lena  This is the punish Long Island KamaaakiYswaha  Where to Ride in Long Island blog for anyone who wants to essay out out most this matter. You observe so such its nigh wearing to fence with you (not that I truly would wantâ€¦HaHa). You definitely put a new acrobatics on a content thats been engrossed roughly for eld. Fastidious foul, but uppercase!  This is the punish Long Island KamaaakiYswaha  Where to Ride in Long Island blog for anyone who wants to essay out out most this matter. You observe so such its nigh wearing to fence with you (not that I truly would wantâ€¦HaHa). You definitely put a new acrobatics on a content thats been engrossed roughly for eld. Fastidious foul, but uppercase! 
Lily Yen  Capilano University and Simon Fraser University  Crossings and Nestings for Arccoloured permutations 
Marko Mitrovic  Simon Fraser University  Hilbert Bases in Matroids 
Marshall Law  USRA at SFU  Dynamic Field Theory: Models of Gazing Behavior 
Matthew Gibson  Simon Fraser University NSERC USRA Undergraduate Research  GCD Computation for Dense Bivariate Polynomials 
Peter Grypma  Trinity Western University  The SMART filter as an efficient data assimilation method in geophysical fluid dynamics 
Roberto Armenta  Simon Fraser University  HighOrder FiniteDifference Methods for Modelling Electromagnetic Wave Propagation 
Robertwed  Castle high school  SUBJ1 
Ryan Goldade  UBC  RealTime Smoke and Fire using Triangle Meshes 
Ryan McBride  Computing Science  Fast Polynomial Division: Heaps of Improvements 
Sonja Surjanovic  SFU Statistics  Quantifying Uncertainty with Polynomial Chaos 
Todd Muirhead  SFU Research Award Project Created an interactive fractal applet for Randall Pyke.  Simulating the chaos game to draw fractals interactively 
Vijaykumar Singh  PIMSSFUUBC  On Mermintype proofs of the KochenSpecker theorem 
Wei Chen  Simon Fraser University Department of Mathematics  Determinants of Matrices With Polynomial Entries 
The Mathematics Department at Simon Fraser University was pleased to present Computational Math Day 2012 (CMD 2012), which was held on Wednesday, August 8th, 2012 at the IRMACS Centre, SFU Burnaby Campus. This annual event showcased the computational expertise of our Department and of other invited speakers.
The program includes invited talks and a Poster Session which will cover diverse topics in mathematics with an emphasis on computation. All participants are encouraged to contribute a poster to the Poster Session.
Prizes for the best undergraduate and graduate posters will be awarded.
Sponsorship from Maplesoft, the Center for Scientific Computing (CSC), the Interdisciplinary Research in the Mathematical and Computational Sciences Centre (IRMACS), the Pacific Institute for the Mathematical Sciences (PIMS), and the SFU Department of Mathematics is gratefully acknowledged. Learn more about our sponsors.
The CMD 2012 Program is a showcase of research in computational mathematics at SFU, UBC, and UVic.
Program Schedule
Date: Wednesday, August 8th, 2012 Location: IRMACS Centre, Simon Fraser University
Time  Event or Speaker  Title of Talk 

9:00am  Registration and Welcome Coffee  
9:30am  Frank Ruskey (Victoria)  Venn diagrams and tatami tilings: vignettes from computational mathematics. 
10:15am  Ian Mitchell (UBC)  
11:00am  Morning Coffee and Poster Setup  
11:15am  Poster Session & Judging  
12:15pm  Buffet Lunch  
1:15pm  Marni Mishna (SFU)  Towards Generating Random Mammalian Genomes. 
2:00pm  Ljiljana Trajkovic (SFU)  Spectral Analysis and Dynamical Behavior of Complex Networks 
2:45pm  Afternoon Coffee  
3:00pm  Benjamin Lundell (Washington)  Influence in Social Networks. 
3:45pm  Award Ceremony  Awards for Putnam participants, Undergraduate Research Prize recipients, Operations Research Team Award, and Poster Prizes. 
4:15pm  Poster Presentations by Award Winners  
4:30pm  Closing Remarks 
The behavior of members of a social network has been studied for many years. The traditional approach has been to look at the aggregate behavior of the network, and then average this aggregate over the network's users to determine a "representative member" of the network. In particular, this method assumes that each member acts independently of his or her peers and ignores the influence one member might have on another. In the last ten years, computer scientists and physicists have developed new approaches to studying this problem which are based on the assumption that a members' peers greatly influence his or her behavior. Thus, these models raise the question, "Who are the most influential members of a social network?" In this talk, I'll discuss some ideas on how to answer this question, and share some results of an ongoing project about political influence in the United States. This is joint work with Chris Aholt.
Genome arrangements, a major mechanism of evolution, shuffle genetic material along chromosomes. Thus, a now standard approach models groups of close genomes as signed permutations. The correct data structure to study permutations in this context is the common interval tree. In this talk we will describe the process of considering tree parameters to refine the class of common interval trees (hence permutations) to those that represent mammalian genomes well. These refinements are particularly amenable to Boltzmann random generation and analytic enumerative techniques. Work in collaboration with Mathilde Bouvel, Cedric Chauve, Rosemary McCloskey, Cyril Nicaud and Carine Pivoteau.
A DC operating point is an equilibrium toward which a circuit will be drawn for sufficiently nearby initial conditions when any inputs are held fixed. DC operating points may or may not be desirable features in a circuit  in an oscillator they represent lockup, but in a memory element they are the mechanism whereby discrete state is
stored. Consequently, it is useful to identify a circuit's DC operating points. Because the circuit is naturally drawn towards them, the most common technique to identifying such equilibria is through simulation; however, it is quite possible for the domain of attraction of an equilibrium to be small enough that simulation is unlikely to find it, yet large enough to cause occasional problems.
In joint work with Mohamed Zaki & Mark Greenstreet, we strung together a collection of public software from the formal verification and numerical analysis communities to rigourously identify and classify all potential DC operating points for surprisingly complex circuit models. Unfortunately, the resulting workflow has proved fragile, and significant effort would be required for reproduction and/or extension. In the second half of the talk I will discuss some tools and techniques that would have significantly improved the reproducibility of the results had they been adopted.
In this talk I will explain how computation has helped me and my students in resolving certain mathematical questions, via two specific recent examples. In the first example, we consider the problem of constructing a simple rotationally symmetric 11Venn diagram. This problem was open for about 40 years and several incorrect solutions were proposed. Initially the problem seemed to be beyond the reach of exhaustive searches, but our recognition of a new type of "nearsymmetry" in Venn diagrams suggested that searching in a certain reduced solution space might be fruitful  which indeed it was. In the second example, we consider a tiling problem first investigated by Don Knuth. On the basis of his computations it seemed that the generating function for counting those tilings was I(z)*S(z) where I(z) was a mysterious irreducible polynomial and S(z) was a well structured and predictable. We have proved that S(z) is what it seemed to be, and revealed many interesting properties of the irreducible I(z), but its exact expression is still not known. [The students mentioned above are Khalegh Mamakani and Alejandro Erickson.]
Discovering properties of the Internet topology is important for evaluating performance of various network protocols and applications. The discovery of powerlaws and the application of spectral analysis to the Internet topology data indicate a complex behavior of the underlying network infrastructure that carries a variety of the Internet applications. In this talk, we present analysis of datasets collected from the Route Views and RIPE projects. The analysis of collected data shows certain historical trends in the development of the Internet topology. While values of various powerlaws exponents have not substantially changed over the recent years, spectral analysis of matrices associated with Internet graphs reveals notable changes in the clustering of Autonomous Systems and their connectivity.
The SFU Mathematics Department invites undergraduate and graduate research students, postdoctoral fellows and faculty members to participate in the Computational Math Day 2012 Poster Session.
The only requirement is that the poster has mathematics in it. It may be applied, pure, computational or experimental mathematics. If you have already prepared a poster for a presentation at another scientific meeting this year, and you would like to present it to members of the Department, this is an appropriate venue. If you wish to present a computer demo this is also possible.
There will be one prize of $200 (winner) and one prize of $100 (runnerup) for the best undergraduate poster, and one prize of $200 (winner) and one prize of $100 (runnerup) for the best graduate poster. Judging will be based on both content and presentation.
Poster titles must be submitted via the online registration form by August 2nd, 2012. Presenters are responsible for printing their own poster.
The posters will be displayed in the IRMACS atrium. Poster presenters can set up their posters as early as 9:00am on August 8th, 2012. The poster and demo session will take place from 11:15am to 1:15pm. Awards will be made at 4:30pm, followed by a presentation of the winning undergraduate and winning graduate poster.
Name  Affiliation  Poster Title (if applicable) 

The Mathematics Department at Simon Fraser University was pleased to present Computational Math Day 2011 (CMD 2011), which was held on Tuesday, August 9th, 2011 at the IRMACS Centre, SFU Burnaby Campus. This annual event showcased the computational expertise of our Department and of other invited speakers.
The program included invited talks and a Poster Session which will cover diverse topics in mathematics with an emphasis on computation. All participants are encouraged to contribute a poster to the Poster Session.
Prizes for the best undergraduate and graduate posters were awarded.
Registration closed as of Thursday, August 4, 2011.
Getting to SFU and the IRMACS Centre
Get directions to SFU and the IRMACS Centre.
Sponsorship from the Centre for Experimental and Constructive Mathematics (CECM), the Center for Scientific Computing (CSC), the Interdisciplinary Research in the Mathematical and Computational Sciences Centre (IRMACS), the Pacific Institute for the Mathematical Sciences (PIMS), and the SFU Department of Mathematics is gratefully acknowledged. Learn more about our sponsors.
The CMD 2011 Program is a showcase of research in computational mathematics at SFU, UBC, and UVic.
Program Schedule
Date: Tuesday, August 9th, 2011 Location: IRMACS Centre, Simon Fraser University
Time  Event or Speaker  Title of Talk 

9:00am  Registration and Welcome Coffee  
9:30am  Adam Oberman (SFU)  Discrete geometric game interpretations of nonlinear elliptic partial differential equations 
10:15am  Wendy Myrvold (UVic)  Searching for a maximum set of mutually orthogonal Latin squares of order 10 
11:00am  Morning Coffee and Poster Setup  
11:15am  Poster Session & Judging  
12:15pm  Buffet Lunch  
1:15pm  Jessica Conway (UBC)  Viral load in treated HIV+ individuals modeled using branching processes 
2:00pm  Cedric Chauve (SFU)  Looking for lost genomes 
2:45pm  Afternoon Coffee  
3:00pm  Matt DeVos (SFU)  Homomorphisms to Clebsch, proof by computer 
3:45pm  Poster Awards  
3:55pm  Poster Presentations by Award Winners  
4:15pm  Closing Remarks 
Paleogenomics aims at reconstructing the genomes of extinct species, whose DNA can not be sequenced due to molecular decay. Hence the only possible approach is the study of current genomes (i.e. descendants of these extinct species) to detect conserved features that might indicate ancestral genomic characters and then to assemble these characters into ancestral genomes. Although the initial question is clearly biological, it can only be answered through an inference process that relies on both a mathematical model for ancient genomes and computational methods within this model. In this talk, I will present recent results on this problem, that rely on relatively old combinatorial notions such as the Consecutive Ones Property of binary matrices and PQtrees.
I will discuss a stochastic model of withinhost HIV viral dynamics. The modeling is motivated by observations of viral load in HIV+ patients on antiretroviral treatment: though the treatment very effectively inhibits viral replication, a treated HIV+ individual's viral load remains nonzero. Further, blood tests show occasional "viral blips," short periods of increased viral load. We adopt the hypothesis that this low viral load can be attributed to activation of cells latently infected by HIV before treatment initiation. Blips would then represent smallprobability deviations from the mean. Modeling this system as a branching process, we compute probability distributions for viral load using a novel numerical approach. These distributions yield blip amplitudes consistent with patient data. We then compute probability distributions on duration of these blips through direct numerical simulation. Our stochastic model of latent cell activation reproduces features of treated HIV infection, and can be used to provide insight into variability of treatment outcomes for HIV+ individuals not available in deterministic models.
Computer proofs are nothing new in graph theory... after all our most famous theorem, the Four Colour Theorem, was proved by a computer 35 years ago. I will discuss this and other computer proofs in graph theory, then detail a recent contribution of this type due to Robert Samal and myself. We give a computer proof that every cubic graph of girth at least 17 has a homomorphism to the Clebsch Graph.
A Latin square of order n is a n×n array of n symbols such that each symbol appears exactly once in each row and exactly once in each column. Two Latin squares of order n are orthogonal if, when superimposed, each ordered pair of symbols occurs exactly once. One of the big unsolved problems in design theory is to determine if it is possible to ﬁnd three or more pairwise orthogonal Latin squares of order 10. This talk describes both theoretical and computational attempts at resolving this question. The talk will conclude with some suggestions for promising areas for continued search.
The research presented in this talk was done in collaboration with Russell Campbell, Erin Delisle, Mark Ellingham, Leah Howard, Nikolay Korovaiko, Brendan McKay, Alison Meynert, and Ian Wanless.
In this mostly nontechnical talk, I will present discrete geometric games, which in simple cases you will be able to solve on a blackboard. Starting with familiar games, such as random walks, we will add new twists (choosing biased diffusions, exit strategies, random turns).
These games lead to interpretations and effective solution methods for nonlinear partial differential equations which appear in areas such as: Differential Geometry, Stochastic Control, Mathematical Finance, and Homogenization. Typical examples include: HamiltonJacobi equations, the MongeAmpere equation, and the equation for the Convex Envelope.
The SFU Mathematics Department invites undergraduate and graduate research students, postdoctoral fellows and faculty members to participate in the Computational Math Day 2011 Poster Session.
The only requirement is that the poster has mathematics in it. It may be applied, pure, computational or experimental mathematics. If you have already prepared a poster for a presentation at another scientific meeting this year, and you would like to present it to members of the Department, this is an appropriate venue. If you wish to present a computer demo this is also possible.
There will be one prize of $200 (winner) and one prize of $100 (runnerup) for the best undergraduate poster, and one prize of $200 (winner) and one prize of $100 (runnerup) for the best graduate poster. Judging will be based on both content and presentation.
Poster titles must be submitted via the online registration form by Thursday, August 4, 2011. Presenters are responsible for printing their own poster.
The posters will be displayed in the IRMACS atrium. Poster presenters can set up their posters as early as 9:00am on August 9, 2011. The poster and demo session will take place from 11:15am to 1:15pm. Awards will be made at 4:30pm, followed by a presentation of the winning undergraduate and winning graduate poster.
Poster Title (if applicable)  Affiliation  Name 

On the side of disorder : some problems in pattern avoidance  Department of Mathematics, Simon Fraser University  Julian Sahasrabudhe 
Outputsensitive enumeration of Tucker patterns  SImon Fraser University  Maria Tamayo 
PQtrees and their applications to comparitive genomics.  CECM, Simon Fraser University  Rosemary McCloskey 
Theoretical advances on multichromosomal DCJ median computation  Department of Mathematics, Simon Fraser University  Ahmad Mahmoody 
Unravelling the Resonant Instabilities of a Stratified Gravity Wave  Department of Mathematics, Simon Fraser University  Yuanxun (Bill) Bao 
Location: Talks will be held in the IRMACS Centre's Presentation Studio. The poster session will be held in the IRMACS Centre's Atrium.
IRMACS is located on the second floor of the Applied Sciences building, SFU Burnaby Campus. Following are links to web pages to help you navigate your way around SFU, Vancouver and BC.
If you would like to register for the 2011 Computational Math Day, please fill out the following form.
The Mathematics Department at Simon Fraser University is pleased to present Computational Math Day 2010 (CMD 2010). CMD 2010 will be held on Thursday, August 12, 2010 at the IRMACS Centre, SFU Burnaby Campus. This annual event will showcase the computational expertise of our Department.
The program includes invited talks and a Poster Session which will cover diverse topics in mathematics with an emphasis on computation. All participants are encouraged to contribute a poster to the Poster Session. Visit the Poster Information page to learn more.
Cash prizes for the best undergraduate and graduate posters will be awarded.
Registration is required.
Get directions to SFU and the IRMACS Centre.
Sponsorship from the Centre for Experimental and Constructive Mathematics (CECM), the Interdisciplinary Research in the Mathematical and Computational Sciences Centre (IRMACS), the Pacific Institute for the Mathematical Sciences (PIMS), and the Mathematics of Information Technology and Complex Systems (MITACS) is gratefully acknowledged. Learn more about our sponsors.
The CMD 2010 Program is a showcase of the SFU Mathematics Department's research in computational mathematics.
Program Schedule
Date: Thursday, August 12, 2010 Location: IRMACS Centre, Simon Fraser University
Time  Speaker  Session Title 

8:30am  Registration  
9:00am  Andrew Rechnitzer (UBC)  GAS sampling of polygons and knot probability ratios 
9:45am  Nils Bruin (SFU)  Decidability of the existence of rational points on algebraic curves 
10:30am  Coffee Break / Poster Set Up  
10:45am  Poster Session  
12:15pm  Lunch at the Himalayan Peak  
1:30pm  Anne Greenbaum (UW)  Crouzeix's Conjecture and Perturbed Jordan Blocks 
2:15pm  Nilima Nigam (SFU)  How do bones grow? From lab to desktop, a mathematical journey 
3:00pm  Poster Awards  
3:05pm  Coffee Break  
3:30pm  MaryCatherine Kropinski (SFU)  Fast intergral equation methods for the heat equation and the modified Helmholtz equation in two dimensions 
4:15pm  Mike Monagan (SFU)  Sparse Polynomial Interpolation 
5:00pm  Closing Remarks 
Poster Information
The SFU Mathematics Department invites graduate and undergraduate research students, postdoctoral fellows and faculty members to participate in the Computational Math Day 2010 Poster Session.
The only requirement is that the poster has mathematics in it. It may be applied, pure, computational or experimental mathematics. If you have already prepared a poster for a presentation at another scientific meeting this year, and you would like to present it to members of the Department, this is an appropriate venue. If you wish to present a computer demo this is also possible.
Up to four prizes (two at 200 dollars and two at 100 dollars) will be awarded to participants with the best posters. Judging criteria are based 50% on content and 50% on presentation.
Poster titles must either be emailed to Marni Mishna, or submitted via the online registration form by Monday, August 2, 2010. Please include the presenter names, title of the poster, and if applicable, the poster file in PDF format. Presenters are responsible for printing their own poster.
The posters will be displayed in the IRMACS atrium. Poster presenters can set up their posters as early as 8:30am on August 12, 2010. The poster and demo session will take place from 10:45am to 12:00pm. Awards will be presented at 3:00pm.
Name  Affiliation  Poster Title 

Marni Mishna  Simon Fraser University  
Michael Monagan  Simon Fraser University  
Mahdi Javadi  Simon Fraser University  On Sparse Interpolation over Finite Fields 
Soo Go  Simon Fraser University  
Steve Kieffer  Simon Fraser University  
Bryan Quaife  Simon Fraser University  Fast Integral Equation Methods for the Modified Helmholtz Equation 
Stephen Melczer  Simon Fraser University  Prime Decomposition of Ideals in Polynomial Rings 
Petr Lisonek  Simon Fraser University  
Hui Yi Lu  Simon Fraser university  
Andrew Arnold  Simon Fraser University  A fast recursive algorithm for computing cyclotomic polynomials 
Robert Shih  Simon Fraser University  Plotting Algebraic Plane Curves Containing Singularities 
Todd Keeler  Simon Fraser University  Rendering Smoke via Fast Vortex Methods 
Niamh Chaparro  Simon Fraser University  An Intro to the Dissipative Particle Dynamics Simulation Method 
Sophie Burrill  Simon Fraser University  On kcrossings and knestings of permutations 
Cory Ahn  Simon Fraser University  Multiplication of Univariate Polynomials over Algebraic Number Fields 
Radina Droumeva  Simon Fraser University  Image Segmentation: Finding Eyeballs in 3D Brain MRI Images 
Jonathan Jedwab  Simon Fraser University  
Michael de Guzman  Simon Fraser University  A Nonlocal Isoperimetric Problem 
Natalia Iwanski  Simon Fraser University  Directionality of Criminal Vectors Phase 2: Modelling Disruptions along an Offender's Journey to Crime 
Valerie Chong  Simon Fraser University  The Math Behind Your Childhood Toys 
Aki Ayukawa Avis  Simon Fraser University  Using a Power Filter to Search for Golay Triads 
Jane Wodlinger  Simon Fraser University 

Brittany Froese  Simon Fraser University  Fast Finite Difference Methods for the Elliptic MongeAmpere Equation 
Reanne Bowlby  Simon Fraser University 
Simulating Nclass Pedestrian Flow Using CLAWPACK 
Alexander Molnar  Simon Fraser University  
James Ratcliffe  Simon Fraser University  
Michael Fry  Simon Fraser University  Dynamical Systems in the Cognitive Architecture of Syllabification 
Veselin Jungic  Simon Fraser univerrsity  
Amy Wiebe  Simon Fraser University  A new construction of Golay sequences of length 2^m 
YunJung Kim  Simon Fraser University  
Karen Yeats  Simon Fraser University  
Aleksandar Vlasev  Simon Fraser University  Calculation of Feynman Integrals using Dodgson Polynomial Identities 
Konrad Duch  Simon Fraser University  Calculation of Feynman Integrals using Dodgson Polynomial Identities 
Kevin Doerksen  Simon Fraser University  
Cedric Chauve  Simon Fraser University  
Ahmad Mahmoody  Simon Fraser University 

Ashok Rajaraman  Simon Fraser University  
Yuanxun Bill Bao  Simon Fraser University  Linear Instability of a Wave in a Density Stratified Fluid 
Behnam Torabi  Simon Fraser University  Mathematical Models for Selforganization of Biological Groups 
Parousia Rockstroh  Simon Fraser University  The Closest Point Method 
KaiUwe Schmidt  Simon Fraser University  
Gordon Hiscott  Simon Fraser University  A Mathematical Model & Numerical Studies of Cyclical Neutropenia 
Yang Xin  Simon Fraser University  
Mariolys Rivas  Simon Fraser University  Dfinite symmetric functions 
Navid Alaei  Simon Fraser University  
Nils Bruin  Simon Fraser University  
Roman Pearce  Simon Fraser University  
Anne Greenbaum  University of Washington  
Andrew Rechnitzer  University of British Columbia  
Thomas Wong  University of British Columbia  
Mahdad Khatirinejad  Aalto University  
Nilima Nigam  Simon Fraser University  
Manfred Trummer  Simon Fraser University  
Benjamin Crestel  Simon Fraser University  
Mehrnoush Malekesmaeili  Simon Fraser University  
Peter Borwein  Simon Fraser University 
Location: Talks will be held in the IRMACS Centre's Presentation Studio. The poster session will be held in the IRMACS Centre's Atrium.
IRMACS is located on the second floor of the Applied Sciences building, SFU Burnaby Campus. Following are links to web pages to help you navigate your way around SFU, Vancouver and BC.
Centre for Experimental and Constructive Mathematics  www.cecm.sfu.ca  CECM's mandate is to explore and promote the interplay of conventional mathematics with modern computation and communication in the mathematical sciences. The Centre provides a sophisticated but easy to use computational environment for research and collaboration in the mathematical sciences. 
Interdisciplinary Research in the Mathematical and Computational Sciences Centre  www.irmacs.sfu.ca  The IRMACS Centre is a unique, interdisciplinary research facility that enables collaborative interaction  intellectually, physically and virtually. IRMACS focuses on facilitating the human interactions that are critical in interdisciplinary research by providing the technologies and technical support to promote effective interactions (computational, networking, humancomputer interaction, remote collaboration, and visualization). By removing the traditional boundaries between scientific disciplines and physical boundaries due to distance, IRMACS creates a synergistic environment on an international scale. 
Pacific Institute for the Mathematical Sciences  www.pims.math.ca  PIMS promotes research in and applications of the mathematical sciences, facilitates the training of highly qualified personnel, enriches public awareness of and education in the mathematical sciences, and creates mathematical partnerships with similar organizations in other countries. 
SFU Department of Mathematics  www.math.sfu.ca  The Department of Mathematics currently numbers 39 faculty. In a typical semester the ranks of regular faculty are augmented with up to 20 postdoctoral fellows and Visiting Professors. At present the Department has a graduate enrolment around 80. The Department has earned a national and international reputation as one of the most forwardlooking and broadbased mathematical sciences departments in Canada. Undergraduate and graduate students thrive in the highly interactive and personalized environment which characterizes the Department and is typical of the unique character of Simon Fraser University. We offer a broad program of training in contemporary Mathematics, but also specialize in various areas for which we are internationally recognized. 
CECM, Maplesoft, MITACS, IRMACS and PIMS are pleased to present "CECM 2009", a summer conference hosted by CECM under the title "Summer Workshop on Computational Mathematics" at Simon Fraser University.
CECM 2009 is a one day meeting on Friday, July 24, 2009. It is one in a series of informal summer meetings.
The Workshop Program includes talks and a poster session which cover diverse topics in mathematics with an emphasis on computation. Participants are invited to contribute a poster at the Poster Session.
CECM, Maplesoft, MITACS, IRMACS and PIMS are pleased to present "CECM 2007", a summer conference hosted by CECM under the title "Summer Workshop on Computational Mathematics" at Simon Fraser University.
CECM 2007 is a one day meeting on Wednesday, August 8, 2007. It is one in a series of informal summer meetings.
The Workshop Program includes talks and a poster session which cover diverse topics in mathematics with an emphasis on computation. Participants are invited to contribute a poster at the Poster Session
CECM, Maplesoft, MITACS, IRMACS and PIMS are pleased to present "CECM 2006", a summer conference hosted by CECM under the title "Summer Workshop on Computational Mathematics" at Simon Fraser University.
CECM 2006 is a one day meeting on Wednesday, August 9, 2006. It is one in a series of informal summer meetings.
The Workshop Program includes talks and a poster session which cover diverse topics in mathematics with an emphasis on computation. Participants are invited to contribute a poster at the Poster Session.