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
Tutte Colloquium -Oliver Pechenik-Dynamics of Increasing Tableaux
| Speaker: | Oliver Pechenik |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: Standard tableaux are certain grids of numbers that lead a double life in algebraic combinatorics, with distinct roles in geometry and in representation theory. Extending the geometry to K-theory led to a corresponding extension of the combinatorics to a theory of increasing tableaux. I will discuss a long and ongoing program to explicate the combinatorial dynamics of these tableaux, which seems to be revealing that they also have a mysterious second life in representation theory. Despite the algebraic connections, the core problem is fundamentally combinatorial: to give a sufficiently good bijection between tableaux and a set of planar diagrams.
Algebraic and Enumerative combinatorics seminar -Oliver Pechenik-Revenge of the increasing tableau dynamics
| Speaker: | Oliver Pechenik |
| Affiliation: | University of Waterloo |
| Location: | MC 6460 |
Abstract: Standard tableaux are certain grids of numbers that lead a double life in algebraic combinatorics, with distinct roles in geometry and in representation theory. Extending the geometry to K-theory led to a corresponding extension of the combinatorics to a theory of increasing tableaux. I will discuss a longstanding plot by such tableaux to prevent me from explicating their combinatorial dynamics. Despite their reticence, we seem to be uncovering that these tableaux also have a mysterious second life in representation theory.
There will be a pre-seminar presenting relevant background at beginning graduate level starting at 1:30pm in MC 5417.
Crypto Reading Group - Maggie Simmons-HQC Implementation and Optimization
Abstract: This week will cover the implementation and optimization of key sub-routines within HQC. We will begin by examining the implementation of Reed-Solomon decoding within HQC, which includes the BCH-view of syndromes, weighted Newton's identity, the Berlekamp-Massey algorithm, and more. We will also discuss high-performance polynomial multiplication via the Karatsuba algorithm and hardware optimization.
References: [3] and [4]
[3] J. Dong, Y. Hou, S. Wang, L. Sha, F. Xiao, Z. Dong, and J. Lin. HIGH: Harnessing GPU Parallelism for Optimized HQC Performance. In IACR Cryptology ePrint Archive, 2026.
[4] HQC Team. Hamming Quasi-Cyclic (HQC), NIST Submission, 2025.
A week-by-week plan is outlined at the following link: https://www.leonardocolo.com/seminars/Spring26.html.
|