Title: Quantum walks on regular graphs
Title: Permutation factorization and methods from mathematical physics
| Speaker: | Sean Carrell |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Title: On the linear convergence of the Frank-Wolfe algorithm
| Speaker: | Javier Pena |
| Affiliation: | Carnegie Mellon University |
| Room: | MC 6486 |
Abstract:
Title: The inertia bound for a graph is not always tight
Title: Excluding a uniform matroid
| Speaker: | Jim Geelen |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract: I will discuss various conjectures concerning minor-closed classes of matroids that omit a uniform matroid.
Title: The history of Tutte-Whitney polynomials
| Speaker: | Graham Farr |
| Affiliation: |
Monash University |
Title: On almost all matroids
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract: I will discuss a recent paper of Pendavingh and Van der Pol that resolved several natural, long-standing conjectures about the properties of almost all matroids. Namely, for some m that is polylogarithmic in n, almost all matroids on n elements are m-connected, have girth at least m, and have the rank-m self-dual uniform matroid as a minor.
Title: Douglas-Rachford feasibility methods for matrix completion problems
| Speaker: | Jonathan Borwein |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract: Many successful non-convex applications of the Douglas-Rachford reflection method for finding a point in the intersection of two sets can be viewed as the reconstruction of a matrix, with known properties, from a subset of its entries.
Title: On the edit distance of powers of cycles
Title: Approximation algorithms for facility location