# Welcome to Combinatorics and Optimization

Spring 2020 Undergraduate Research Assistantship Program (URA). ***ON-LINE APPICATIONS OPEN November 1, 2019.***

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 2020 applications now open

1. Dec. 23, 2019Outstanding Teaching Assistant Award

2. Nov. 14, 2019Faculty of Mathematics Research Chair

C&O Professor Levent Tuncel has been awarded a five-year Faculty of Mathematics Research Chair. The award recognizes Levent's exceptional scholarly achievements and pre-eminence in the field of optimization.

3. Nov. 7, 2019"Protocols for Authentication and Key Establishment" is published by Springer

The book, written by Colin Boyd, Anish Mathuria and C&O Professor Douglas Stebila, is the most comprehensive and integrated treatment of the protocols required for authentication and key establishment.

1. Jan. 30, 2020Algebraic Combinatorics Seminar - Neal Madras

Title: Random Pattern-Avoiding Permutations

 Speaker: Neal Madras Affiliation: York University Room: MC 5417

Abstract:

A "pattern of length k" is simply a permutation of {1,..,k}.  This pattern is said to be contained in a permutation of {1,...,N} (for N>k) if there is a subsequence of k elements of the (long) permutation that appears in the same relative order as the pattern.

2. Jan. 30, 2020Graphs and Matroids Seminar - Paul Wollan

 Speaker: Paul Wollan Affiliation: Sapienza Università di Roma Room: MC 5479

Abstract:

A folklore result says that if a graph does not contain the path of length k as a subgraph, then it has tree-depth at most k.

3. Jan. 31, 2020Combinatorial Optimization Reading Group - Hong Zhou

Title: Network Design $s$-$t$ Effective Resistance

 Speaker: Hong Zhou Affiliation: University of Waterloo Room: MC 5417

Abstract:

We consider a problem of designing a network with small $s$-$t$ effective resistance. In the problem, we are given an undirected graph $G=(V,E)$, two designated vertices $s,t \in V$, and a budget $k$.

All upcoming events