Title: Spins Lattices, Graphs and Quantum State Revivals
|Affiliation:||Université de Montréal|
This talk will describe how certain features of quantum transport along spin chains can be enabled.
Title: Transversals in covers of graphs
|Affiliation:||Université Libre de Bruxelles|
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
|Affiliation:||University of Waterloo|
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
|Affiliation:||University of Pennsylvania|
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
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.)
There are 3 short talks this week.
Title: Quantum Collision-Finding in Non-Uniform Random Functions
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.