Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, February 28, 2020 1:00 pm - 1:00 pm EST (GMT -05:00)

Combinatorial Optimization Reading Group - Sean Kafer

Title: An Introduction to the Circuits of Polyhedra, The Circuit Diameter, and Their Applications

Speaker: Sean Kafer
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

The combinatorial diameter of a polyhedron P is the maximum value of a shortest path between two vertices of P, where the path moves along edges of P. Its study is motivated largely by its implications on the running time of the Simplex algorithm.

Friday, February 28, 2020 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Francisco Rodríguez-Henríquez

Title: Parallel strategies for SIDH: towards computing SIDH twice as fast

Speaker: Francisco Rodríguez-Henríquez
Affiliation: CINVESTAV-IPN
Room: MC 5501

Abstrtact:

Over the last ten years, there has been an intense research effort to find hard mathematical problems that would be presumably hard to solve by a quantum attacker and at the same time could be used to build reasonably efficient public-key cryptoschemes.

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.

Thursday, March 5, 2020 1:00 pm - 1:00 pm EST (GMT -05:00)

Algebraic Graph Theory Seminar - Soffia Arnadottir

Title: Strongly cospectral vertices in cubelike graphs

Speaker: Soffia Arnadottir
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

A cubelike graph is a Cayley graph of the elementary abelian 2-group. Two vertices in a graph are strongly copsectral if they are cospectral and parallel.

Thursday, March 5, 2020 2:30 pm - 2:30 pm EST (GMT -05:00)

Algebraic Combinatorics Seminar - Matt Szczesny

Title: Combinatorial Hall algebras

Speaker: Matt Szczesny
Affiliation: Boston University
Room: MC 5417

Abstract:

The Hall algebra of a finitary category is an associative (and sometimes Hopf) algebra whose structure constants count the number of extensions between objects.

Friday, March 6, 2020 1:00 pm - 1:00 pm EST (GMT -05:00)

Combinatorial Optimization Reading Group - Matt Gerstbrein

Title: Recognizing slack matrices

Speaker: Matt Gerstbrein
Affiliation: University of Waterloo
Room: MC 5417

Abstract:

This week, we will be discussing the topic of slack matrices. Slack matrices arise in the context of lifts of polytopes, where, given a polytope P, we can characterize the existence of a lift of P of a given size in terms of properties of an associated slack matrix.

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.

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.