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
Crypto Reading Group - Seunghoon Lee & Bruno Sterner-Introduction to Coding Theory (Part 1)
Abstract: For this term's reading group, we will be hosting a study group on code-based cryptography with a focus on understanding HQC — the most recent NIST standard for post-quantum KEM/PKE. We will spend 7 weeks going over the necessary material to cover this topic before concluding with state-of-the-art HQC. A week-by-week plan is outlined at the following link: https://www.leonardocolo.com/seminars/Spring26.html.
For the first week, we will cover the basic definitions and properties of coding theory as well as go over Reed-Solomon codes.
|
Tutte Colloquium -Jim Geelen-Tangles in graphs and matroids
| Speaker: | Jim Geelen |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: A common strategy in many proofs and algorithms is to begin by decomposing a graph into more highly connected pieces. Decomposition is easy when the goal is to obtain connected or 2-connected pieces, and decomposition into 3- or 4-connected pieces is also straightforward in many settings. For higher levels of connectivity, however, no effective and widely applicable notion of decomposition is currently known. To address this, Robertson and Seymour introduced tangles, which capture the k-connected regions of a graph without decomposing.