Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Thursday, November 28, 2013 1:00 PM EST
Linear Cayley Graphs, Codes and Geometry
| Speaker: | Mario Huang |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5136 |
Abstract:
Monday, November 25, 2013 4:00 PM EST
Ear-decompositions of nonbipartite matching-covered graphs
| Speaker: | Nishad Kothari |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5168 |
Abstract:
Friday, November 22, 2013 — 3:30 PM to 4:30 PM EST
Some wonderful conjectures (but very few theorems) at the boundary between analysis, combinatorics and probability
| Speaker: | Andrew Childs |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5158 |
Thursday, November 21, 2013 1:00 PM EST
University theorem for polynomial invartiants on ribbon graphs with flags.
| Speaker: | Avohou Remi Cocou |
|---|---|
| Affiliation: | University d'Abomey Calavi |
| Room: | Mathematics and Computer Building (MC) 5136 |
Abstract:
In my presentation, I will recall the Bollobas-Riordan polynomial
for ribbon graphs and its universality property. This polynomial finds
Friday, November 15, 2013 — 3:30 PM to 4:30 PM EST
Solution geometry of a random k-XORSAT near the clustering threshold
| Speaker: | Jane Gao |
|---|---|
| Affiliation: | University of Toronto |
| Room: | Mathematics and Computer Building (MC) 5158 |
Abstract
Friday, November 8, 2013 — 3:30 PM to 4:30 PM EST
Counting Connected Uniform Hypergraphs
| Speaker: | Christiane Sato |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5158 |
Abstract:
Tuesday, November 5, 2013 — 3:30 PM to 4:30 PM EST
Sparsity and gauge optimization
| Speaker: | Michael P. Friedlander |
|---|---|
| Affiliation: | Department of Computer Science, University of British Columbia |
| Room: | Mathematics and Computer Building (MC) 5158 |
Abstract:
Tuesday, November 5, 2013 — 2:30 PM to 3:30 PM EST
Recent Results on Tensor and Polynomial Optimization
| Speaker: | Shuzhong Zhang |
|---|---|
| Affiliation: | University of Minnesota |
| Room: | Mathematics and Computer Building (MC) 5158 |
Abstract
Friday, November 1, 2013 — 3:30 PM to 4:30 PM EDT
Finding small stabilizers for unstable graphs
| Speaker: | Andrew Childs |
|---|---|
| Affiliation: | University of Waterloo |
| Room: | Mathematics and Computer Building (MC) 5158 |
Abstract:
A vertex v of a graph G is called inessential if there exists a maximum matching in G that exposes v. G is said to be stable if the set of its inessential vertices forms a stable set.