# 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

1. June 14, 2019Samuel Jaques awarded the Governor General’s Gold Medal

Samuel Jaques will be awarded the Governor General's Gold Medal (Master) at the June 14th convocation ceremony for his outstanding academic performance.

Under the supervision of Alfred Menezes and Michele Mosca, Jaques achieved an average of 97 per cent during his Master's program while he held an NSERC Graduate Scholarship. He was also awarded the President's Graduate Scholarship and the Rai Mathematics Graduate Scholarship.

2. June 13, 2019Hanmeng Zhan wins the inaugural Mathematics Doctoral Prize competition

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

3. June 10, 2019Spring 2019 convocation

Congratulations to the 12 M.Math. and 3 Ph.D. C&O students who will be awarded their graduate degrees at the Spring 2019 convocation ceremonies!

1. June 25, 2019Algebraic Combinatorics Seminar - William Dugan

Title: Sequences of Trees and Higher-Order Renormalization Group Equations

 Speaker: William Dugan Affiliation: University of Waterloo Room: MC 6483

Abstract:

In 1998, Connes and Kreimer introduced a combinatorial Hopf algebra HCK on the vector space of forests of rooted trees that precisely explains the phenomenon of renormalization in quantum eld theory.

2. June 26, 2019Graphs and Matroids Seminar - Zach Walsh

 Speaker: Zach Walsh Affiliation: University of Waterloo Room: MC 5479

Abstract:

We discuss recent work proving that for any integer $t\ge 2$, any maximum-sized simple $\mathbb C$-representable matroid $M$ of large rank with no $U_{2,t+3}$-minor satisfies $|M|=t{r(M)\choose 2}+r(M)$. It was not our intention to prove this result, so we will first explain our original motivation. We assume only basic knowledge of matroid theory.

3. June 27, 2019Algebraic Combinatorics Seminar - Timothy Miller

Title: From Modeling Fermions to the Puzzle Rule

 Speaker: Timothy Miller Affiliation: University of Waterloo Room: MC 6483*

*room change

Abstract:

A Knutson-Tao-Woodward puzzle is a tiling of a triangle with certain pieces that have labeled edges. The puzzle rule states that number of puzzles with a given boundary is equal to a Littlewood-Richardson coefficient.

All upcoming events