Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Sun  Mon  Tue  Wed  Thu  Fri  Sat 

28

29

30

31

3








4

5

7

9

10








11

12

13

14

16

17









18

19

20

21

22

23

24








25

26

27

28

29

30

31








Title: NonCommutative Algebras and Graphs
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5479Abstract:
I will discuss some of the noncommutative algebras that arise naturally in graph theory.
Title: Counting subdivergencefree gluing of trees
Speaker: Clair Dai Affiliation: University of Waterloo Room: MC 5417Abstract:
If we take two rooted trees with the same number of leaves and form a graph by gluing the leaves of one tree to the other, then we say the graph is subdivergencefree if no 2edge cut have been generated.
Title: The combinatorics of nearest and furthest values
Speaker: Lily Wang Affiliation: University of Waterloo Room: MC 5417Abstract:
A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element.
Title: Bijections among symmetric tableaux via folding and mixed insertion
Speaker: Yuval Ohapkin Affiliation: University of Waterloo Room: MC 5417Abstract:
A standard Young tableau with entries $M < \cdots 1 < 1 < \cdots < M$ can be "folded" by performing certain conversions and rectifications in sequence.
Title: Stable marraige with general preferences
Speaker: Matthew Louis Gerstbrein Affiliation: University of Waterloo Room: MC 5479Abstract:
This week, we discuss a generalization of the standard stable marriage problem, in which one side has a complete, totally ordered, strict preference list while the other has preferences given in terms of arbitrary binary relations.
Title: Optimization and Cryptography in Generalized Physical Theories
Speaker: Jamie Sikora Affiliation: Perimeter Institute Room: MC 5501Abstract:
In this talk, I will discuss three important cryptographic tasks in the quantum and postquantum world. I will discuss the impossibility of bitcommitment and coinflipping, and also the possibility of physically unforgeable money in the framework of Generalized Physical Theories (GPTs).
Title: Feynman graphs, ribbon graphs and tensor graphs
Speaker: Adrian Tanasa Affiliation: Université de Bordeaux Room: MC 5479Abstract:
In this talk I will define the socalled Feynman graphs, which are a particular class of graphs appearing in quantum field theory.
Title: Continuous Quantum Walks
Speaker: Soffia Arnadottir Affiliation: University of Waterloo Room: MC 5479Abstract:
Continuous quantum walks are of considerable interest in quantum physics and quantum computing.
Title: Upsetting Matrices
Speaker: Chris Godsil Affiliation: University of Waterloo Room: MC 5479Abstract:
If $A$ and $P$ are $n\times n$ matrices and the entries of $B$ are small, we may view $A+B$ as a perturbation of $A$, and expect that the spectral properties of $A+B$ should be related to those of $A$.Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.