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, March 17, 2023 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Volker Kaibel

Title: Steiner Cut Dominants

Speaker: Volker Kaibel
Affiliation: Otto von Guericke University Magdeburg
Location: MC 5501 or contact Eva Lee for Zoom link

Abstract: For a subset of terminals T of the nodes of a graph G a cut in G is called a T-Steiner cut if it subdivides T into two non-empty sets. The Steiner cut dominant of G is the Minkowski sum of the convex hull of the incidence vectors of T-Steiner cuts in G and the nonnegative orthant.

Monday, March 20, 2023 3:00 pm - 3:00 pm EDT (GMT -04:00)

A Closure Lemma for tough graphs and Hamiltonian degree conditions - Cléophée Robin

Title : A Closure Lemma for tough graphs and Hamiltonian degree conditions

Speaker: Cléophée Robin
Institution: Wilfrid Laurier University 
Location: MC 5479

Abstract: A graph G is hamiltonian if it exists a cycle in G containing all vertices of G exactly once. A graph G is t-tough if, ,for all subsets of vertices S, the number of connected components in G − S is at most |S| / t.

Thursday, March 23, 2023 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Lucas Gagnon

Title: Quasisymmetric varieties, excedances, and bases for the Temperley--Lieb algebra

Speaker: Lucas Gagnon
Affiliation: York University
Location: MC 6029 please contact Olya Mandelshtam for Zoom link

Abstract:  This talk is about finding a quasisymmetric variety (QSV): a subset of permutations which (i) is a basis for the Temperley--Lieb algebra TL_n(2), and (ii) has a vanishing ideal (as points in n-space) that behaves similarly to the ideal generated by quasisymmetric polynomials.   While this problem is primarily motivated by classical (co-)invariant theory and generalizations thereof, the course of our investigation uncovered a number of remarkable combinatorial properties related to our QSV, and I will survey these as well. 

Friday, March 24, 2023 12:00 pm - 12:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - David Aleman

Title: Subgraph Polytopes and Independence Polytopes of Count Matroids

Speaker: David Aleman
Affiliation: University of Waterloo
Location: MC 6029

Abstract: Given a graph G=(V,E), the subgraph polytope of G is defined as the convex hull of the characteristic vector of the pairs (S,F) such that S is a non-empty subset of vertices and F is a set of edges contained in the induced subgraph G[S].

Friday, March 24, 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 or contact Eva Lee for Zoom link

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.

Monday, March 27, 2023 8:00 pm - 8:00 pm EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Jephian C.-H. Lin

Title: Inverse eigenvalue problem of a graph

Speaker: Jephian C.-H. Lin
Affiliation: National Sun Yat-sen University
Location: Please contact Sabrina Lato for Zoom link

Abstract:  We often encounter matrices whose pattern (zero-nonzero, or sign) is known while the precise value of each entry is not clear. Thus, a natural question is what we can say about the spectral property of matrices of a given pattern. When the matrix is real and symmetric, one may use a simple graph to describe its off-diagonal nonzero support.

Wednesday, March 29, 2023 2:30 pm - 2:30 pm EDT (GMT -04:00)

Algebraic Graph Theory - Sabrina Lato

Title: Distance-Regular and Distance-Biregular Graphs

Speaker: Sabrina Lato
Affiliation: University of Waterloo
Location: MC

Abstract: For a given diameter d and valency k, what is the maximum number of vertices a k-regular graph of diameter d can have, and what graphs meet that bound? Although there is a straightforward counting argument to bound the number of vertices using the structural information, the problem of characterizing the graphs that meet the bound turns out to be a problem in algebraic graph theory, and helps gives rise to the notion of distance-regular graphs.

Thursday, March 30, 2023 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Freddy Cachazo

Title: Arrangements of Pseudolines, Tropical Grassmannians, and Generalized Scattering Amplitudes

Speaker: Freddy Cachazo
Affiliation: Perimeter Institute
Room: MC 6029

Abstract: For each arrangement of (pseudo)lines on the projective plane, it is possible to construct a differential form that captures its combinatorial structure. The forms have simple poles whenever triangles shrink to a point in the arrangement, and share the same residue when two arrangements are connected via a "triangle flip".

Monday, April 3, 2023 11:30 am - 11:30 am EDT (GMT -04:00)

algebraic Graph Theory - Monu Kadyan

Title: Four types of integrality on mixed Cayley graphs over abelian groups

Speaker: Monu Kadyan
Affiliation: Indian Institute of Technology Guwahati
Location: Please contact Sabrina Lato for Zoom link

Abstract: A mixed graph is called H-integral (resp. HS-integral) if the eigenvalues of its Hermitian-adjacency matrix (resp. Hermitian-adjacency matrix of second kind) are integers.

Monday, April 3, 2023 3:00 pm - 3:00 pm EDT (GMT -04:00)

Graph and Matroids Seminar - Alvaro Carbonero

Title: The heroes of digraphs: coloring digraphs with forbidden induced subgraphs

Speaker: Alvaro Carbonero
Affiliation: University of Waterloo
Location: MC 5479

Abstract: The chromatic number is one of the most studied graph invariants in graph theory. $\chi$-boundedness, for instance, studies the induced subgraphs present in graphs with large chromatic number and small clique number. Neumann-Lara introduced an analog directed version of this graph invariant: the dichromatic number of digraphs.