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
- July 14, 2019
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.
- July 9, 2019
Professor Chaitanya Swamy has been appointed to a ten-month term as chair of the Department of Combinatorics and Optimization. His term begins on September 1, 2019.
- June 26, 2019
The Selected Areas in Cryptography (SAC) conference will be held at the University of Waterloo from August 14-16, 2019. The conference co-chairs are Kenneth Paterson (University of London/ETH Zurich) and C&O professor Douglas Stebila.
- July 16, 2019
Title: From Combinatorics to Computer Algebra and Morse Theory - Making Sense of Multivariate Asymptotics
Speaker: Stephen Melczer Affiliation: University of Pennsylvania Room: MC 5479
The asymptotic study of multivariate generating functions comprises the domain of Analytic Combinatorics in Several Variables (ACSV).
- July 18, 2019
Title: Incidence bialgebras of monoidal categories
Speaker: Lucia Rotheray Affiliation: Technische Universität Dresden Room: MC 5417
We begin with Joni and Rota's definition of the incidence coalgebra of a category or partially ordered set and then discuss some cases where a monoidal product on a category turns this coalgebra into a bialgebra.
- July 19, 2019
Title: Stable Flows
Speaker: Sharat Ibrahimpur Affiliation: University of Waterloo Room: MC 5479
We describe a flow model that generalizes ordinary network flows the same way as stable matchings generalize the bipartite matching problem.