The C&O department has 36 faculty members and 60 graduate students. We are intensely research oriented and hold a strong international reputation in each of our six major areas:
- Algebraic combinatorics
- Combinatorial optimization
- Continuous optimization
- Cryptography
- Graph theory
- Quantum computing
Read more about the department's research to learn of our contributions to the world of mathematics!
News
Laura Pierson wins Governor General's Gold Medal
The Governor General’s Gold Medal is one of the highest student honours awarded by the University of Waterloo.
Sepehr Hajebi wins Graduate Research Excellence Award, Mathematics Doctoral Prize, and finalist designation for Governor General's Gold Medal
The Mathematics Doctoral Prizes are given annually to recognize the achievement of graduating doctoral students in the Faculty of Mathematics. The Graduate Research Excellence Awards are given to students who authored or co-authored an outstanding research paper.
Three C&O faculty win Outstanding Performance Awards
The awards are given each year to faculty members across the University of Waterloo who demonstrate excellence in teaching and research.
Events
Crypto Reading Group -Roy Stracovsky
Title:Enhancing Anamorphic Cryptography
| Speaker | Roy Stracovsky |
| Affiliation | Georgia Tech |
| Location | MC 5479 |
Abstract: Anamorphic cryptography (Persiano, Phan, and Yung, Eurocrypt 2022) allows users who share a “double key” to hide encrypted messages in ciphertexts and signatures to allow covert communication under a hypothetical “dictator” who can monitor all communication or force parties to give up their cryptographic keys in order to check for compliance.
Algebraic and enumerative combinatorics seminar-Zeus Dantas E Moura
Title: Algebraic and enumerative combinatorics seminar
| Speaker | Zeus Dantas E Moura |
| Affiliation | University of Wtaerloo |
| Location | MC 6029 |
Abstract:
Permuted-basement Macdonald polynomials E_α^σ(x_1, ..., x_n; q, t) are nonsymmetric generalizations of symmetric Macdonald polynomials indexed by a composition α and a permutation σ. They can be described combinatorially as generating functions over augmented fillings of shape α and basement σ.
We construct deterministic and probabilistic bijections on fillings that prove identities relating
E_α^σ, E_α^{σ s_i}, E_{s_i α}^σ, and E_{s_i α}^{σ s_i}.
These identities arise from two operations on the shape and basement: swapping adjacent parts of the shape, which expands
E_α^σ intoE_{s_i α}^σ and E_{s_i α}^{σ s_i}; and swapping adjacent basement entries,
which gives E_α^σ = E_α^{σ s_i} when α_i = α_{i+1}.
There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm.