Seminar

Thursday, June 6, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - David Wagner

Title: Toric varieties from distributive lattices

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

Abstract:

Given a nite lattice L, consider the ring of complex polynomials in indeterminates indexed by L, modulo the ideal generated by (XaXb-Xa^bXa_b for all a; b 2 L).

Friday, May 31, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Akshay Ramachandran

Title: A Fixed-Point Approach to Stable Matchings

Speaker: Akshay Ramachandran
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

This talk will be independent of the previous reading group talk. Three classical results in stable matching are the correctness of Gale Shapley’s deferred acceptance algorithm, the result of Conway that Stable Matchings form a distributive lattice, and Vande Vate and later Rothblum’s result that the convex hull of stable matchings has a polynomial-sized linear description.

Friday, May 24, 2019 2:03 pm - 2:03 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Chris Godsil

Title: Free Groups

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

(The "free" in the title is an adjective, not a verb.) I will discuss free groups from a combinatorial perspective, focusing on the connections to fundamental groups and covers of graphs.

Thursday, May 30, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Kevin Purbhoo

Title: Wronskians of polynomials

Speaker: Kevin Purbhoo
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

The Mukhin-Tarasov-Varchenko (MTV) theorem is the following statement in real algebraic geometry. If the wronskian of a set of complex polynomials has only real roots, then the vector space spanned by these polynomials is real.

Friday, May 31, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Anurag Anshu

Title: Quantum Log-Approximate-Rank Conjecture is also False

Speaker: Anurag Anshu
Affiliation: Institute for Quantum Computing - University of Waterloo
Room: MC 5501

Abstract:

In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication complexity of a total function `f', hence refuting the log approximate rank conjecture of Lee and Shraibman [2009].

Friday, May 24, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Mikhail Isaev

Title: The sandwich conjecture of random regular graphs and more

Speaker: Mikhail Isaev
Affiliation: Monash University
Room: MC 5501

Abstract:

The sandwich conjecture formulated in [Kim, Vu, Advances in Math., 2004] states that if d >> log n, then the random d-regular graph on n vertices R(n, d) can asymptotically almost surely be ”sandwiched” between G(n, p1) and G(n, p2) where probabilities p1 and p2 are both (1 + o(1))d/n.

Wednesday, May 22, 2019 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Mikhail Isaev

Title: The distribution of tree parameters via the martingale CLT

Speaker: Mikhail Isaev
Affiliation: Monash University
Room: MC 5479

Abstract:

Tree parameters, like pattern or symmetry counts, have been extensively studied in the literature for various random models.

Thursday, May 16, 2019 2:30 pm - 2:30 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Chris Godsil

Title: The 600-cell as a Cayley graph

Speaker: Chris Godsil
Affiliation: University of Waterloo
Room: MC 5479

Abstract:

I will discuss some of the things we can learn about the 600-cell by viewing it as a Cayley graph for the group SL(2,5) (once I've discussed the basic properties of this group).