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
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.
Prof. Alfred Menezes is named Fellow of the International Association for Cryptologic Research
The Fellows program, which was established in 2004, is awarded to no more than 0.25% of the IACR’s 3000 members each year and recognizes “outstanding IACR members for technical and professional contributions to cryptologic research.”
C&O student Ava Pun receives Jessie W. H. Zou Memorial Award
She received the award in recognition of her research on simulating virtual training environments for autonomous vehicles, which she conducted at the start-up Waabi.
Events
Tutte colloquium-Thomas Lesgourgues
Title:Odd-Ramsey numbers of complete bipartite graphs
| Speaker: | Thomas Lesgourgues |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs ℋ, defined as the minimum number of colours needed to colour the edges of the complete graph so that every copy of a graph H in ℋ intersects some colour class by an odd number of edges. In recent joint work with Simona Boyadzhiyska, Shagnik Das, and Kaline Petrova, we focus on the odd-Ramsey numbers of complete bipartite graphs. First, using polynomial methods, we completely resolve the problem when ℋ is the family of all spanning complete bipartite graphs on n vertices. We then focus on its subfamilies. In this case, we establish an equivalence between the odd-Ramsey problem and a well-known problem from coding theory, asking for the maximum dimension of a linear binary code avoiding codewords of given weights. We then use known results from coding theory to deduce asymptotically tight bounds in our setting. We conclude with bounds for the odd-Ramsey numbers of fixed (that is, non-spanning) complete bipartite subgraphs.
Algebraic Graph Theory-Alexander Van Werde
Title: Towards generalized spectral determinacy of random graphs
| Speaker: | Alexander Van Werde |
| Affiliation: | Eindhoven University of Technology |
| Location: | Please contact Sabrina Lato for Zoom link. |
Abstract: Wang and Xu (2006, 2017) discovered sufficient conditions for a graph to be uniquely characterized by the spectra of its adjacency matrix and of its complement graph. They conjectured that these conditions are satisfied with nonvanishing frequency, but this remains open and it was not clear what proof techniques could be used. I will present a new line of attack which approaches the problem as a question about random groups. This allows making connections to proof techniques from combinatorial random matrix theory. The results which I will present are in a toy case, but it is expected that the employed perspective will generalize.
This talk is based on my paper “Cokernel statistics for walk matrices of directed and weighted random graphs” [Combinatorics, Probability and Computing (2025)]
Algebraic and enumerative combinatorics seminar-Leigh Foster
Title:The squish map and the SL_2 double dimer model
| Speaker | Leigh Foster |
| Affiliation | University of Waterloo |
| Location | MC 5479 |
Abstract: A plane partition, whose 3D Young diagram is made of unit cubes, can be approximated by a "coarser” plane partition, made of cubes of side length 2. Two such approximations can be obtained by "rounding up” or "rounding down” to the nearest cube. We relate this coarsening (or downsampling) operation to Young's squish map, introduced in earlier work. We exhibit a related measure-preserving map between the 2-periodic single dimer model on the honeycomb graph, and a particular instance of Kenyon's SL_2 double dimer model on a coarser honeycomb graph. This allows us to apply existing computations from the 2-periodic single dimer partition function to a portion of the parameter space of the the harder double dimer model. We also specialize our map and exhibit new criterion for the signed-tilability of a closed region on the honeycomb graph.
There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1pm,