Welcome to Combinatorics and Optimization

Spring 2019 Undergraduate Research Assistantship Program (URA)Applications for the Spring 2019 program are now closed.


Tutte's Distinguished Lecture Series 

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   


Grad Studies: Fall 2019 applications now open

 New Deadline: February 1, '19


  1. May 16, 2019Waterloo Coloring Conference 2019

    Professors Michelle Delcourt, Zdenek Dvorak and Luke Postle are organizing a conference on graph colorings (September 23-27, 2019).

  2. May 4, 2019Eddie Cheng is a recipient of an Alumni Achievement AwardEddie Cheng

    Professor Cheng will receive his award at the Alumni Achievement Awards luncheon at 12:30 pm on June 13.

  3. Apr. 27, 2019Hanmeng Zhan wins the inaugural Mathematics Doctoral Prize competitionHarmony Zhan

    This new prize will be awarded annually to recognize the achievement of graduating doctoral students in the Faculty of Mathematics.

Read all news
  1. May 30, 2019Algebraic Combinatorics Seminar - Kevin Purbhoo

    Title: Wronskians of polynomials

    Speaker: Kevin Purbhoo
    Affiliation: University of Waterloo
    Room: MC 5417

    Abstract:

    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.

  2. May 31, 2019Combinatorial Optimization Reading Group - Akshay Ramachandran

    Title: A Fixed-Point Approach to Stable Matchings

    Speaker: Akshay Ramachandran
    Affiliation: University of Waterloo
    Room: MC 5479

    Abstract:

    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.

  3. May 31, 2019Tutte Colloquium - Anurag Anshu

    Title: Quantum Log-Approximate-Rank Conjecture is also False

    Speaker: Anurag Anshu
    Affiliation: Institute for Quantum Computing - University of Waterloo
    Room: MC 5501

    Abstract:

    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 [2009].

All upcoming events