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:
Thursday, May 18, 2023 3:00 pm - 3:00 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Jerónimo Valencia Porras

Title: Snake decomposition of lattice path matroids

Speaker: Jerónimo Valencia Porras 
Affiliation: University of Waterloo
Location: MC 5501

Abstract: Lattice path matroids (LPMs) are positroids whose base polytopes have a nice decomposition. We provide a geometric perspective to this decomposition in terms of fences and their order polytopes, which correspond to a certain class of LPMs we call snakes.

Friday, May 19, 2023 3:30 pm - 3:30 pm EDT (GMT -04:00)

Distinguished Tutte Lecture - Petter Brändén

Title: Lorentzian polynomials

Speaker: Petter Brändén
Affiliation: KTH Royal Institute of Technology
Location: MC 5501 

Abstract: Lorentzian polynomials on cones are intimately connected to Hodge theory, matroid theory and the geometry of zeros of polynomials.

Tuesday, May 23, 2023 2:30 pm - 2:30 pm EDT (GMT -04:00)

URA Seminar - Ronen Wdowinski

Title: Bounded degree arboricity

Speaker: Ronan Wdowinski
Affiliation: University of Waterloo
Location: MC 5479

Abstract: For a multigraph $G$ together with a positive weight $f(v)$ on every vertex $v$, we study the problem of covering the edge set of $G$ by the minimum number of forests $F$ in which every vertex $v$ has degree at most $f(v)$ in $F$.

Friday, May 26, 2023 1:30 pm - 1:30 pm EDT (GMT -04:00)

Continuous Optimization Seminar - Kay Barshad

Title: Generalized Modular String Averaged Procedure and Its Applications to Iterative Methods

Speaker: Kay Barshad
Affiliation: University of Waterloo
Location: MC 6029

Abstract: A modular string averaging procedure (MSA, for short) for a finite number of operators  was first introduced by Reich and Zalas in 2016. The MSA concept provides a flexible  algorithmic framework for solving various feasibility problems such as common fixed point and convex feasibility problems.

Friday, May 26, 2023 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Wouter Castryck

Title: Breaking the Supersingular Isogeny Diffie-Hellman protocol

Speaker: Wouter Castryck
Affiliation: KU Leuven
Location: Please contact Eva Lee for Zoom link

Abstract: Finding an explicit isogeny between two given isogenous elliptic curves over a finite field is considered a hard problem, even for quantum computers.

Monday, May 29, 2023 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory: Steve Kirkland

Title: Eigenvalues for stochastic matrices with a prescribed stationary distribution

Speaker: Steve Kirkland
Affiliation: University of Manitoba
Location: Please contact Sabrina Lato for Zoom link

Abstract: A square nonnegative matrix T is called stochastic if all of its row sums are equal to 1. Under mild conditions, it turns out that there is a positive row vector w^T (called the stationary distribution for T) whose entries sum to 1 such that the powers of T converge to the outer product of w^T with the all-ones vector. Further, the nature of that convergence is governed by the eigenvalues of T.

In this talk we explore how the stationary distribution for a stochastic matrix exerts an influence on the corresponding eigenvalues.

Monday, May 29, 2023 1:00 pm - 1:00 pm EDT (GMT -04:00)

C&O Reading Group: Gabriel Morete

Title: Bounding the extended complexity of the stable set polytope on perfect graphs

Speaker: Gabriel Morete
Affiliation: University of Waterloo
Room: MC 6029

Abstract: This week we will study the extension complexity of the stable set polytope for perfect graphs. More than 40 years ago, Grötschel et al. gave an algorithm to find maximal weight stable sets on perfect graphs based on a compact semidefinite extension. However, whether there is a compact linear extension is still an open problem.

Monday, May 29, 2023 2:30 pm - 2:30 pm EDT (GMT -04:00)

URA Seminar - Logan Crew

Title: Chromatic Symmetric Functions: Combining Algebra and Graph Theory

Speaker: Logan Crew
Affiliation: University of Waterloo
Room: MC 5479

Abstract: The chromatic polynomial, enumerating the proper colorings of a graph by number of colors used, was created by Birkhoff in the early 1900s to study the then Four-Color Conjecture.  In the 1990s, Stanley generalized this to a chromatic symmetric function, which further counts for each proper n-coloring how many times each of the n colors is used.  

Friday, June 2, 2023 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - David Gosset

Title: On the complexity of quantum partition functions

Speaker: David Gosset
Affiliation: University of Waterloo
Location: MC 5501

Abstract: Quantum complexity theory has been intertwined with the study of quantum many-body systems ever since Kitaev's insight that computing their ground energies is an intractable quantum constraint satisfaction problem that is complete for a quantum generalization of NP.