Future students

Friday, May 8, 2020 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Ricardo Fukasawa

Zoom (for information email emma.watson@uwaterloo.ca

Title: Hardness of set-partitioning formulation for the vehicle routing problem with stochastic demands

Speaker: Ricardo Fukasawa
Affiliation: University of Waterloo
Location: Online (Zoom)

Abstract:

The vehicle routing problem considers the cheapest way to serve a set of customers using a fixed set of vehicles. When a vehicle serves a customer, it picks up its demand which is given as an input, and the total demand picked up cannot exceed the vehicle’s capacity. This classical combinatorial optimization problem combines aspects of routing (like a traveling salesman problem) and packing (like a knapsack problem).

Tom Kelly
Recent PhD graduate Tom Kelly has been awarded first place in the Faculty of Mathematics Doctoral Prize competition. Now in its second year, these prizes are awarded annually to recognize the achievements of top graduating doctoral students in the Faculty of Mathematics.

Tuesday, March 10, 2020 8:42 am - 8:42 am EDT (GMT -04:00)

Tutte Colloquium - François Bergeron

Title: Rectangular Catalan Algebraic Combinatorics

Speaker François Bergeron
Affiliation LACIM - Université du Québec à Montréal
Room MC 5501

Abstract:

The enumeration of Dyck-like lattice paths in a m x n rectangle has a long and fruitful history culminating in Bizley-Grossman’s formula (1954). We will discuss how it is natural to extend this formula to weighted enumeration, with parameters accounting for such statistics as area; and to consider parking-function analogs.

Friday, March 13, 2020 3:30 pm - 3:30 pm EDT (GMT -04:00)

CANCELLED Tutte Colloquium - Nicolas Trotignon

Title: Widths in even-hole-free graphs

Speaker: Nicolas Trotignon
Affiliation: École Normale Supérieure de Lyon
Room: MC 5501

Abstract:

Historically, the study of even-hole-free graphs is motivated by the analogy with perfect graphs. The decomposition theorems that are known for even-hole-free graphs are seemingly more powerful than the ones for perfect graphs: the basic classes and the decompositions are more restricted.

Thursday, March 12, 2020 4:00 pm - 4:00 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Luke Postle

Title: Improving the general upper bound for Hadwiger's conjecture

Speaker: Luke Postle
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

In 1943, Hadwiger conjectured that every K_t-minor-free graph has chromatic number at most t-1.

Thursday, March 12, 2020 2:30 pm - 2:30 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - David Wagner

Title: Proof of the monotone column permanent conjecture

Speaker: David Wagner
Affiliation: University of Waterloo
Room: MC 5417

Abstract: 

In 1993, Jim Haglund conjectured the following.  If  A  is a  square matrix of real numbers which are weakly decreasing down each column, and J is the all-ones matrix of the same size, then the permanent of the matrix xJ+A is a polynomial with only real roots.

Friday, March 13, 2020 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Harry Sivasubramaniam

Title:

Speaker: Harry Sivasubramaniam
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

Differential privacy is about preserving an individuals privacy while maintaining utility in the context of data analysis.

Tuesday, March 3, 2020 1:15 pm - 1:15 pm EST (GMT -05:00)

Continuous Optimization Seminar - Naomi Graham

Title: Introduction to Monotone Operators

Speaker: Naomi Graham
Affiliation: University of Waterloo
Room: MC 5501

Abstract: 

This talk will be an entry level introduction to the theory of monotone operators as they are presented in Bauschke and Combette’s Convex Analysis and Monotone Operator Theory in Hilbert Spaces.