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:
Monday, August 31, 2020 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - William J. Martin

Title: Scaffolds

Speaker: William J. Martin
Affiliation: Worcester Polytechnic Institute
Zoom: Contact Soffia Arnadottir

Abstract:

Building on the work of various authors who have used tensors in the study of association schemes and spin models, I propose the term "scaffold" for certain tensors that have been represented by what are sometimes called "star-triangle diagrams" in the literature. The main goal of the talk is to introduce and motivate these objects which somewhat resemble partition functions as they appear in combinatorics. (The exact definition is too cumbersome to include here.)

Monday, September 7, 2020 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Eric Moorhouse

Title: Projective Planes, Finite and Infinite

Speaker: Eric Moorhouse
Affiliation: University of Wyoming
Zoom: Contact Soffia Arnadottir

Abstract:

A projective plane is a point-line incidence structure in which every pair of distinct points has a unique joining line, and every pair of distinct lines meets in a unique point. Equivalently (as described by its incidence graph), it is a bipartite graph of diameter 3 and girth 6. 

Friday, September 11, 2020 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Luke Postle

Title: Further progress towards Hadwiger's conjecture

Speaker: Luke Postle
Affiliation: University of Waterloo
Zoom: Please email Emma Watson.

Abstract:

In 1943, Hadwiger conjectured that every graph with no $K_t$ minor is $(t-1)$-colorable for every $t\ge 1$. In the 1980s, Kostochka and Thomason independently proved that every graph with no $K_t$ minor has average degree $O(t\sqrt{\log t})$ and hence is $O(t\sqrt{\log t})$-colorable. 

Title: Extensions of the Erdős-Ko-Rado theorem to 2-intersecting perfect matchings and 2-intersecting permutations

Speakers: Andriaherimanana Sarobidy Razafimahatratra & Mahsa Nasrollahi Shirazi
Affiliation: University of Regina
Zoom: Contact Soffia Arnadottir

Abstract:

The Erdős-Ko-Rado (EKR) theorem is a classical result in extremal combinatorics. It states that if n and k are such that $n\geq 2k$, then any intersecting family F of k-subsets of [n] = {1,2,...,n} has size at most $\binom{n-1}{k-1}$. Moreover, if n>2k, then equality holds if and only if F is a canonical intersecting family; that is, $\bigcap_{A\in F}A = \{i\}$, for some i in [n].

Monday, September 14, 2020 3:00 pm - 3:00 pm EDT (GMT -04:00)

Graphs and Matroids Seminar - Oliver Lorscheid

Title: Foundations of Matroids without Large Uniform Minors, Part 2

Speaker: Oliver Lorscheid
Affiliation: Instituto Nacional de Matemática Pura e Aplicada
Zoom: Contact Rose McCarty

Abstract:

In this talk, we take a look under the hood of last week’s talk by Matt Baker: we inspect the foundation of a matroid.

The first desired properties follow readily from its definition: the foundation represents the rescaling classes of the matroid and shows a functorial behaviour with respect to minors and dualization.

Thursday, September 17, 2020 2:30 pm - 2:30 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Logan Crew

Title: Edge Deletion-Contraction in the Chromatic and Tutte Symmetric Functions

Speaker: Logan Crew
Affiliation: University of Waterloo
Zoom: Contact Karen Yeats

Abstract:

We consider symmetric function analogues of the chromatic and Tutte polynomials on graphs whose vertices have positive integer weights. We show that in this setting these functions admit edge deletion-contraction relations akin to those of the corresponding polynomials, and we use these relations to give enumerative and/or inductive proofs of properties of these functions.

Monday, September 21, 2020 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Paul Terwilliger

Title: Leonard pairs, spin models, and distance-regular graphs

Speaker: Paul Terwilliger
Affiliation: University of Wisconsin
Zoom: Contact Soffia Arnadottir

Abstract:

A Leonard pair is an ordered pair of diagonalizable linear maps on a finite-dimensional vector space, that each act on an eigenbasis for the other one in an irreducible tridiagonal fashion. In this talk we consider a type of Leonard pair, said to have spin.

Thursday, September 24, 2020 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Aram Dermenjian

Title: Sign variations and descents

Speaker: Aram Dermenjian
Affiliation: York University
Zoom: Contact Karen Yeats

Abstract:

In this talk we consider a poset structure on projective sign vectors. We show that the order complex of this poset is partitionable and give an interpretation of the h-vector using type B descents of the type D Coxeter group.

Monday, September 28, 2020 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Soffia Arnadottir

Title: Strongly cospectral vertices, Cayley graphs and other things

Speaker: Soffia Arnadottir
Affiliation: University of Waterloo
Zoom: Contact Soffia Arnadottir

Abstract:

In this talk we will look at a connection between the number of pairwise strongly cospectral vertices in a translation graph (a Cayley graph of an abelian group) and the multiplicities of its eigenvalues. We will use this connection to give an upper bound on the number of pairwise strongly cospectral vertices in cubelike graphs.

Friday, October 2, 2020 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Levent Tuncel

Title: Total Dual Integrality for Convex, Semidefinite and Extended Formulations

Speaker: Levent Tuncel
Affiliation: University of Waterloo
Zoom: Please email Emma Watson

Abstract:

Within the context of characterizations of exactness of convex relaxations of 0,1 integer programming problems, we present a notion of total dual integrality for Semidefinite Optimization Problems (SDPs), convex optimization problems and extended formulations of convex sets.