Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Title: Upsetting Matrices
Speaker: | Chris Godsil |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
Title: Continuous Quantum Walks
Speaker: | Soffia Arnadottir |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
Continuous quantum walks are of considerable interest in quantum physics and quantum computing.
Title: Feynman graphs, ribbon graphs and tensor graphs
Speaker: | Adrian Tanasa |
Affiliation: | Université de Bordeaux |
Room: | MC 5479 |
Abstract:
In this talk I will define the so-called Feynman graphs, which are a particular class of graphs appearing in quantum field theory.
Title: Optimization and Cryptography in Generalized Physical Theories
Speaker: | Jamie Sikora |
Affiliation: | Perimeter Institute |
Room: | MC 5501 |
Abstract:
In this talk, I will discuss three important cryptographic tasks in the quantum and post-quantum world. I will discuss the impossibility of bit-commitment and coin-flipping, and also the possibility of physically unforgeable money in the framework of Generalized Physical Theories (GPTs).
Title: Stable marraige with general preferences
Speaker: | Matthew Louis Gerstbrein |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
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: Counting subdivergence-free gluing of trees
Speaker: | Clair Dai |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
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 subdivergence-free if no 2-edge cut have been generated.
Title: The combinatorics of nearest and furthest values
Speaker: | Lily Wang |
Affiliation: | University of Waterloo |
Room: | MC 5417 |
Abstract:
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 5417 |
Abstract:
A standard Young tableau with entries $-M < \cdots -1 < 1 < \cdots < M$ can be "folded" by performing certain conversions and rectifications in sequence.
Title: Non-Commutative Algebras and Graphs
Speaker: | Chris Godsil |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
I will discuss some of the non-commutative algebras that arise naturally in graph theory.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within our Office of Indigenous Relations.