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: Robust discrete optimization and network flows (paper by Bertsimas and Sim)
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: 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: 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: An elementary approach to the quasipolynomiality of the Kronecker coefficients
Title: The combinatorics of Standard Young tableaux of bounded height
| Speaker: | Marni Mishna |
| Affiliation: | Simon Fraser University |
| Room: | MC 5501 |
Abstract:
Standard Young tableaux are a classic object of mathematics, appearing in problems from representation theory to bijective combinatorics.
Title: LWE part 3: The relation with BDD
| Speaker: | Luis Ruiz |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: The last piece of the puzzling reduction
Title: The Number 6 Hash Function Collision
| Speaker: | Chris Godsil |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: If V is a vector space of dimension d over the eld GF(q), we have all sorts of families of
Title: Coloring Graphs of Bounded Maximum Degree with Small Clique Number
| Speaker: | Tom Kelly |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: Greedy coloring yields an upper bound on the chromatic number $\chi$ of $\Delta+1$ for graphs of maximum degree at most $\Delta$, which is tight for cliques.