Tutte Colloquium

The Tutte Colloquium — named in memory of William T. Tutte — is our departmental colloquium dedicated to all aspects of combinatorics, optimization, cryptography, and quantum computing. Our local audience consists principally of combinatorics students, postdocs, and faculty across these areas, and colloquium talks should aim to inform such a “general combinatorics audience”.

Talks are 50 minutes, with questions following, and take place Fridays from 3:30 – 4:30. The Zoom room opens 15 minutes before each talk (whether online only or hybrid) and will stay open after the talks for social activities. Videos may be recorded and uploaded to our department YouTube channel — speakers will only be recorded with their explicit permission.

Plans for the Winter semester are in flux due to the changing conditions of the pandemic. All talks throughout the semester will be broadcast online via Zoom for participants to watch remotely. If the public health situation allows, we will hopefully run in a hybrid format where talks will be available to watch on campus and via Zoom and we alternate between remote and in-person speakers. Anyone attending in person must adhere to Waterloo’s safety requirements around COVID-19 (in particular, a mask must be worn at all times and all attendees must be fully vaccinated against COVID-19).

Winter 2022

Scheduling in progress.

Fall 2021

Date Speaker Institution Title
Dec 3 Minh Bui Waterloo Warped Proximal Iterations for Multivariate Convex Minimization in Hilbert Spaces
Nov 26 Ashwin Nayak Waterloo Quantum Distributed Complexity of Graph Diameter and Set Disjointness
Nov 19 Steph van Willigenburg UBC The (3+1)-free conjecture of chromatic symmetric functions
Nov 12 Greg Zaverucha Microsoft Research Shorter Zero-Knowledge Proofs from MPC
Nov 5 László Végh LSE On complete classes of valuated matroids
Oct 22 Ahmad Abdi LSE Dyadic Linear Programming
Oct 8 Sophie Spirkl Waterloo Induced subgraphs and treewidth
Oct 1 Stephen Jordan Microsoft Quantum Quantum information science for combinatorial optimization
Sept 24 Tibor Jager Wuppertal Tightly-Secure Digital Signatures
Sept 17 Alex Pothen Perdue Approximation Algorithms for Matchings in Big Graphs
Sept 10 Jane Ye Victoria On solving bilevel programming problems
Sept 3 Ross Kang Radboud Chromatic structure in locally sparse graphs

Previous Speakers in 2020 and 2021: Liana Yepremyan, Olya Mandelshtam, Jon Yard, Dmitriy Drusvyatskiy, Marni Mishna, Cécile Pierrot, Kanstantsin Pashkovich, Stephen Melczer, Hao Huang, Hao Hu, Tom Kelly, Alicia Kollár, Felix Joos, Bill Cook, Debbie Leung, Robert Morris, Robert Hildebrand, Elchanan Mossel, Michael Naehrig, David Gosset, Anupam Gupta, Santanu Dey, Oliver Pechenik, Jordan Ellenberg, Nisheeth Vishnoi, Chloe Martindale, Logan Crew, David P. Williamson, Boaz Barak, Levent Tuncel, Alexey Pokrovskiy, Henry Wolkowicz, Luke Postle, Joseph Paat, Léo Ducas, Jim Luedtke, Hamza Fawzi, Shachar Lovett, Felix Leditzky, Peter Selinger, David Wagner, Nicolas Trotignon, Courtney Paquette, Lauren K. Williams, Jane Gao, Daniel Grier, Ricardo Fukasawa, François Bergeron, Peter Nelson, Francisco Rodríguez-Henríquez

For information on my past organization of Waterloo’s Algebraic and Enumerative Combinatorics Seminar, see here.