We hope you are enjoying your time in our graduate programs. Check out our course offerings, information about degree completion, the PhD qualifying exams, the PhD lecturing requirement, and instructions on submitting your PhD annual activity report. If you still have some years ahead in your grad studies, you might be interested in applying for scholarships.
If you have any administrative questions, please contact us at cograd@uwaterloo.ca.
Seminars in Combinatorics and Optimization
Algebraic Graph Theory - Cristina Dalfó
Title: The spectra of lift and factored lifts of graphs or digraphs
Speaker: |
Cristina Dalfó |
Affiliation: | Universitat de Lleida |
Location: | Please contact Sabrina Lato for the Zoom link. |
Abstract: In this talk, we first explain the path we took from defining polynomial matrices to a generalization of voltage graphs that we call combined voltage graphs. Moreover, we give a general definition of a matrix associated with a combined voltage graph, which allows us to provide a new method for computing the eigenvalues and eigenspaces of such graphs.
C&O Reading Group - Prashant Gokhale
Title: NC algorithm to find perfect matching in planar graphs
Speaker: | Prashant Gokhale |
Affiliation: | University of Waterloo |
Location: | MC 6029 |
Abstract: Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder than finding one (the former is #P-complete and the latter is in P), and on the other, for planar graphs, counting has long been known to be in NC whereas finding one has resisted a solution.
URA Seminar - URA Presentations
Speaker: | Arnav Kumar | Elan Li | Max Jiang | Kai Choi |
Seminar Title: | Dimension of posets and random graph orders |
Formalizing matroids induced from a matroid by a bipartite graph |
Formalizing a generalized Hall's marriage theorem | Index calculus over elliptic curves |
Location: MC 5479
There will be a social starting at 1:00 pm.