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: Spins Lattices, Graphs and Quantum State Revivals
Speaker: | Luc Vinet |
Affiliation: | Université de Montréal |
Room: | MC 5501 |
Abstract:
This talk will describe how certain features of quantum transport along spin chains can be enabled.
Title: Transversals in covers of graphs
Speaker: | Krystal Guo |
Affiliation: | Université Libre de Bruxelles |
Room: | MC 5501 |
Abstract:
We study a polynomial with connections to correspondence colouring (also known as DP-colouring) and the Unique Games Conjecture.
Title: Interpolating between the characteristic and matching polynomials of a graph
Speaker: | Chris Godsil |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
The characteristic polynomial Φ(X, t) of a graph X has two obvious combinatorial connections.
Title: Robust discrete optimization and network flows (paper by Bertsimas and Sim)
Title: Generating Functions: Theory, Algorithms, and Applications
Speaker: | Stephen Melczer |
Affiliation: | University of Pennsylvania |
Room: | MC 5501 |
Abstract:
Generating functions are an invaluable tool in many areas of discrete mathematics and beyond.
Title: Graphs and Unitals
Title: Robust Solutions of Optimization Problems Affected by Uncertain Probabilities (paper by Ben-Tal A et al )
Title: Erdos-Hajnal meets Gyarfas-Sumner
Speaker: | Paul Seymour |
Affiliation: | Princeton |
Room: | QNC 1501 |
Abstract:
The Gyarfas-Sumner conjecture says that every graph with huge (enough) chromatic number and bounded clique number contains any given forest as an induced subgraph. (And non-forests do not have this property.)
Title: Quantum Collision-Finding in Non-Uniform Random Functions
Speaker: | Ted Eaton |
Affiliation: | ISARA Corporatio |
Room: | MC 6486 |
Abstract: Proving the security of a scheme against a quantum adversary often makes the strong assumption of modelling the hash function as uniformly random. In this work, we study the generic security of non-uniform random functions, specifically those with min-entropy k. This has applications to the quantum security of the Fujisaki-Okamoto transformation, as well as allowing for more relaxed security assumptions. We discuss previous results and sketch a proof for an asymptotic upper and lower bound of 2k/3 quantum queries.
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.