Simon Fraser University

This conference will involve presentations on the modeling and analysis of wave phenomena. It is one of the main venues where significant advances in the analysis and computational modeling of wave phenomena and exciting new applications are...

Abstract: Let s(n) denote the sum of the proper divisors of n, so, e.g., s(4)=1+2=3. A natural number n is called *perfect* if s(n)=n and *amicable* if s(n) =/= n but s(s(n))=n. For example, 6 is a perfect number, and 220 is an amicable number...

Abstract: Graphs and co-graphs (their matroid duals) dominate the structure of Totally Unimodular Matrices, real matrices whose subdeterminants lie in {0, +1, -1}. Thus some results about graph colorings and flows have common generalizations...

Abstract: Given a binary matroid $M$ represented by a binary matrix $A$ we can consider the binary matroid represented by $A$ plus an extra binary row$\\Sigma$. We call this a signed matroid and say that $(M,\\Sigma)$ is arepresentation of the signed...

Abstract: Aquantum walk is a quantum process on graph. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on theamplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We will try...