Welcome to Combinatorics and Optimization

Winter 2020 Undergraduate Research Assistantship (URA) Opportunities.

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. Sep. 1, 2019Carsten Thomassen: Dean's Distinguished Visiting Professor

    Professor Carsten Thomassen, one of the foremost graph theorists in the world, will hold the Faculty of Mathematics Dean's Distinguished Visiting Professorship in Fall 2019.

  2. July 14, 2019Crypto 2019 Best Young Researcher Award
    IACR logo

    C&O graduate students Samuel Jaques and John Schanck have won the Best Young Researcher Paper Award at Crypto 2019, the 39th Annual International Cryptology Symposium. Their paper, Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE, will be presented on August 20 in Santa Barbara.

  3. July 9, 2019Chaitanya Swamy appointed Acting Chair of C&O
    Chaitanya Swamy

    Professor Chaitanya Swamy has been appointed to a ten-month term as acting chair of the Department of Combinatorics and Optimization. His term begins on September 1, 2019.

Read all news
  1. Sep. 19, 2019Algebraic Graph Theory Seminar - Chris Godsil

    TitleOrthogonal Polynomials and the Addition Formula

    Speaker: Chris Godsil
    Affiliation: University of Waterloo
    Room: MC 5479


    Many questions about designs and codes in the unit sphere can be reduced to questions about members of a family of orthogonal polynomials, the so-called Gegenbauer polynomials.

  2. Sep. 19, 2019Algebraic Combinatorics Seminar - Nick Olson-Harris

    Title: When are two Schur functions the same?

    Speaker: Nick Olson-Harris
    Affiliation: University of Waterloo
    Room: MC 5417


    A pair of skew shapes are said to be (skew) equivalent if they admit the same number of semistandard tableaux of any weight; i.e. if their associated skew Schur functions are equal.

  3. Sep. 19, 2019Graphs and Matroids Seminar - Peter Nelson

    Title: The sparsest matroids omitting an independent flat

    Speaker: Peter Nelson
    Affiliation: University of Waterloo
    Room: MC 5501


    Given integers $k,r \ge 1$, what is the smallest a rank-$r$ matroid can be that does not contain a $k$-element independent set that is also a flat? I will answer this question, characterize the extremal examples, and draw parallels with a problem in graph theory.

All upcoming events