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-Stephen Melczer
Title:Automated Sequence Asymptotics
| Speaker: | Stephen Melczer |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract:Computing with any sort of object requires a way of encoding it on a computer, which poses a problem in enumerative combinatorics where the objects of interest are (infinite) combinatorial sequences. Thankfully, the generating function of a combinatorial sequence often satisfies natural algebraic/differential/functional equations, which can then be viewed as data structures for the sequence. In this talk we survey methods to take a sequence encoded by such data structures and automatically determine asymptotic behaviour using techniques from the field of analytic combinatorics. We also discuss methods to automatically characterize the asymptotic behaviour of multivariate sequences using analytic combinatorics in several variables (ACSV). The focus of each topic will be rigorous algorithms that have already been implemented in computer algebra systems and can be easily used by anyone.
Tutte colloquium-Ashwin Nayak
Title:Learning quantum states
| Speaker: | Ashwin Nayak |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: Suppose we are given a sequence of quantum registers initialized to the same quantum state rho, and would like to learn the state rho. That is, we would like to design an algorithm that produces a classical description of an approximation to the state. How many copies of rho dowe need to be able to produce a suitable approximation? This talk will be a gentle introduction to the problem and related results.