Welcome to Combinatorics and Optimization
Spring 2019 Undergraduate Research Assistantship Program (URA). Applications for the Spring 2019 program are now closed.
The very successful Tutte's 100th Distinguished Lecture Series has now completed. That success has led to a Tutte Distinguished Lecture once per term. The next lecture will happen in the Spring term.
*Recordings of occurred talks are all available on C&O's YouTube Channel.
New Deadline: February 1, '19
- May 16, 2019
Professors Michelle Delcourt, Zdenek Dvorak and Luke Postle are organizing a conference on graph colorings (September 23-27, 2019).
- May 4, 2019
Professor Cheng will receive his award at the Alumni Achievement Awards luncheon at 12:30 pm on June 13.
- Apr. 27, 2019
This new prize will be awarded annually to recognize the achievement of graduating doctoral students in the Faculty of Mathematics.
- May 30, 2019
Title: Wronskians of polynomials
Speaker: Kevin Purbhoo Affiliation: University of Waterloo Room: MC 5417
The Mukhin-Tarasov-Varchenko (MTV) theorem is the following statement in real algebraic geometry. If the wronskian of a set of complex polynomials has only real roots, then the vector space spanned by these polynomials is real.
- May 31, 2019
Title: A Fixed-Point Approach to Stable Matchings
Speaker: Akshay Ramachandran Affiliation: University of Waterloo Room: MC 5479
This talk will be independent of the previous reading group talk. Three classical results in stable matching are the correctness of Gale Shapley’s deferred acceptance algorithm, the result of Conway that Stable Matchings form a distributive lattice, and Vande Vate and later Rothblum’s result that the convex hull of stable matchings has a polynomial-sized linear description.
- May 31, 2019
Title: Quantum Log-Approximate-Rank Conjecture is also False
Speaker: Anurag Anshu Affiliation: Institute for Quantum Computing - University of Waterloo Room: MC 5501
In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication complexity of a total function `f', hence refuting the log approximate rank conjecture of Lee and Shraibman .