Events

Laplacian Perfect State Transfer

Speaker:	Harmony Zhan
Affiliation:	University of Waterloo
Room:	Mathematics and Computer Building (MC) 6486

Abstract: 

I will talk about perfect state transfer relative to the standard Laplacian matrix, the signless Laplacian matrix and the normalized Laplacian matrix. Some of these are related to adjacency perfect state transfer on the line graphs.

Density Ramsey Type Results

Speaker:	Jim Geelen
Affiliation:	University of Waterloo
Room:	Mathematics 3 (M3) 3103

Abstract: 

In this talk we will present the density versions of the Hales--Jewett Theorem and the Carlson--Simpson Theorem. The Hales--Jewett Theorem is one of the most representing theorems in Ramsey theory (see \cite{HJ}). Its density version was first  proved by H. Furstenberg and Y.

Connections Between Quantum Walks and Some Graph Properties

Speaker:	Gabriel Coutinho
Affiliation:	University of Waterloo
Room:	Mathematics and Computer Building (MC) 6486

Abstract: 

Let A be the adjacency matrix of a graph. Then we define a quantum system in the graph whose state at a positive time t is given by the matrix exp(i t A), where i is the imaginary constant.

A Survey of Graph-like Continua and Infinite Matroids

Speaker:	Bruce Richter
Affiliation:	University of Waterloo
Room:	Mathematics 3 (M3) 3103

Abstract: 

In the last 20 years or so, there has been a lot of work done on extensions of results from finite graphs to compactifications of infinite graphs.

The 6th International Conference on Post-Quantum Cryptography will be held at the Institute for Quantum Computing at the University of Waterloo. Professor Michele Mosca will serve as program chair, while Professor Alfred Menezes will serve as General Chair. The conference will be preceded by a summer school from September 29-30.

Multivariate Diagonals, D-finite Functions, and Lattice Path Enumeration

Speaker:	Stephen Melczer
Affiliation:	University of Waterloo
Room:	Mathematics and Computer Building (MC) 5168

Abstract: 

In this talk we look at the efficacy of encoding D-finite generating functions (those satisfying linear differential equations) as diagonals of multivariate rational functions, with a particular focus on lattice path model

Approximation Algorithms for Vehicle-Routing Problems

Speaker:	Chaitanya Swamy
Affiliation:	University of Waterloo
Room:	Mathematics 3 (M3) 3103

Abstract: 

Vehicle-routing problems (VRPs) constitute a broad class of combinatorial-optimization problems that have been widely studied in both the operations research and computer science literature.

On the Diameter and Longest Paths in Random Apollonian Networks

Speaker:	Jim Geelen
Affiliation:	University of Waterloo
Room:	Mathematics and Computer Building (MC) 6486

Abstract: 

Start with a triangle embedded in the plane. In each step, choose a bounded face uniformly at random, add a vertex inside that face and join it to the vertices of the face.

Enumeration of Graphs with a Heavy-tailed Degree Sequence

Speaker:	Nick Wormald
Affiliation:	Monash University
Room:	Mathematics (M3) 3103

Abstract: 

The number of graphs with a given degree sequence is still not known in any convenient form, even asymptotically, for moderately dense graphs. We obtain a formula that includes some heavy-tailed sequences in the sparse case (i.e.

Detecting Communities by Voting Model

Speaker:	Yu. Nesterov
Affiliation:	CORE/UCL, Belgium
Room:	Mathematics and Computer Building (MC) 5136B

Abstract:

In this talk we analyze a voting model based on random preferences of participants. Each voter can choose a party with certain probability, which depends on the divergence between his preferences and a flexible position of the party.