Current students

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

Speaker: Lizzie Pratt
Affiliation: Perimeter Institute
Location: MC 5417

Abstract: On-shell forms are differential forms on the Grassmannian which arise in particle physics. They are defined using bipartite graphs with n distinguished boundary vertices. Mathematical investigation of on-shell forms has largely focused on the case of planar graphs, where one can use tools developed by Postnikov in the study of the totally nonnegative Grassmannian. In this talk we develop the mathematics of nonplanar on-shell forms, and explain how they arise in physics and math. For certain forms on the Grassmannian Gr(2,n), we prove a determinantal formula appearing in the physics literature, and give a connection to the hypertree divisors of Castravet and Tevelev.

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:30pm.

Friday, September 25, 2026 3:30 pm - 4:30 pm EDT (GMT -04:00)

Tutte Colloquium - Generating and utilizing various types of negative dependence

Speaker: Aravind Srinivasan
Affiliation: University of Maryland
Location: MC 5501

Abstract: Various notions of negative dependence arise naturally and/or are desirable in various random processes and randomized algorithms. We survey how to generate and utilize a few such notions of negative dependence, and sketch applications to concentration inequalities, fairness, and approximation algorithms.

Monday, September 28, 2026 3:00 pm - 4:00 pm EDT (GMT -04:00)

Graphs and Matroids - Kaioke Begay- Finitary and Cofinitary Oriented Matroids

Speaker: Kaioke Begay
Affiliation: University of Waterloo
Room: MC 6029

Abstract: Much like matroids, oriented matroids can be defined on finite ground sets using a set of circuit axioms. Oriented matroid duality is an important property which is difficult to maintain in the infinite setting. One way to define infinite oriented matroids in a way that preserves duality is using signed set orthogonality. This allows for the notion of finitary and cofinitary oriented matroids. An oriented matroid is called finitary if all of its circuits have finite support, and cofinitary if it is the dual of a finitary oriented matroid. It has recently been shown that cofinitary oriented matroids do not necessarily satisfy the circuit axioms. In the finite setting, there are many ways to define oriented matroids which are equivalent to the circuit axioms. Here, we prove that some of these definitions still hold for cofinitary oriented matroids, even when the circuit axioms fail.