DISCRETE CATS SEMINAR

Discrete CATS Seminar

Title: BOGO Sale

Abstract: This talk will consist of two 20 minute talks which I will be giving at the Joint Math Meetings. Feedback will be solicited.



2:00 - 2:20 Title: k-matching sequences of simplicial complexes.



Abstract: The homotopy type of the matching complex, M_1(G), has been studied for paths, cycles, and trees. In this talk we will generalize 1-matching complex to k-matching complexes, denoted M_k(G) and consider the sequence (M_1(G), M_2(G),…,M_n(G)) up to homotopy for perfect caterpillar graphs.



2:25 - 2:45 Title: A positivity phenomenon in Elser’s Gaussian-cluster percolation model



Abstract: Veit Elser proposed a random graph percolation model in which physical dimension appears as a parameter. From this model, numerical graph invariants els_k(G) , called Elser numbers, naturally arise and Viet Elser conjectured that els_k(G) \geq 0 for all graph $G$ and integers k \geq 2. In this talk we will interpret the Elser numbers as Euler characteristics of nucleus (simplicial) complexes and prove Elser’s conjecture. This is joint work with Galen Dorpalen-Barry, Cyrus Hettle, David Livingston, Jeremy Martin, George Nasr, and Hays Whitlatch.

Date:
-
Location:
POT 745

Discrete CATS Seminar

Title: An introduction to quiver mutations and green sequences.
 
Abstract: Quiver mutation is an operation one can define on a directed graph that has shown to model the behavior of a large variety of mathematical objects including algebra, topology, physics and number theory. More specifically it arises when studying Teichmuller theory, total positivity of matrices, and even the behavior of high energy particle impacts. We will introduce the process of quiver mutation, and the proceed to explore quivers for a special sequence of mutations called maximal green sequences. The aim of the talk is to discuss recent work that allows one to build maximal green sequences for larger quivers by looking at "component preserving" sequences on induced subquivers. These new techniques have allowed us to construct maximal green sequences for large families of quivers where their existence was previously unknown.
Date:
-
Location:
POT 745

Discrete CATS Seminar

Title: An introduction to quiver mutations and green sequences.
 
Abstract: Quiver mutation is an operation one can define on a directed graph that has shown to model the behavior of a large variety of mathematical objects including algebra, topology, physics and number theory. More specifically it arises when studying Teichmuller theory, total positivity of matrices, and even the behavior of high energy particle impacts. We will introduce the process of quiver mutation, and the proceed to explore quivers for a special sequence of mutations called maximal green sequences. The aim of the talk is to discuss recent work that allows one to build maximal green sequences for larger quivers by looking at "component preserving" sequences on induced subquivers. These new techniques have allowed us to construct maximal green sequences for large families of quivers where their existence was previously unknown.
Date:
-
Location:
POT 745

Qualifying Examination

Speaker:  William Gustafson

Title:  Shellability of the uncrossing partial order on matchings

Abstract:

We introduce the uncrossing partial order on matchings, which first arose as the face posets of stratified spaces of planar resistor networks. We discuss its relationship to the type A Bruhat order and give an EC-shelling due to Patricia Hersch and Richard Kenyon.

Date:
-
Location:
POT 745
Event Series:

Discrete CATS Seminar

Title: Chromatic symmetric homology for graphs: some new developments

 
Abstract: In his study of the four colour problem, Birkhoff showed that the number of ways to colour a graph with k colours is a polynomial P(k) in k, which he called the chromatic polynomial.  Later, Stanley defined the chromatic symmetric function X, which is a multivariable lift of the chromatic polynomial so that when the first k variables are set to 1, it recovers P(k).  We showed that this can be further lifted to a homological setting so that its bigraded Frobenius character recovers X. In this talk, we survey some new results regarding the strength of the chromatic symmetric homology of a graph, and state some (surprising?) conjectures.  A part of the talk will be devoted to discussing Specht modules for symmetric group over the complex field, and other fields. This is based on joint work with Chandler, Sazdanovic, and Stella.
Date:
-
Location:
POT 745`

Discrete CATS Seminar

Title: Chromatic symmetric homology for graphs: some new developments

 
Abstract: In his study of the four colour problem, Birkhoff showed that the number of ways to colour a graph with k colours is a polynomial P(k) in k, which he called the chromatic polynomial.  Later, Stanley defined the chromatic symmetric function X, which is a multivariable lift of the chromatic polynomial so that when the first k variables are set to 1, it recovers P(k).  We showed that this can be further lifted to a homological setting so that its bigraded Frobenius character recovers X. In this talk, we survey some new results regarding the strength of the chromatic symmetric homology of a graph, and state some (surprising?) conjectures.  A part of the talk will be devoted to discussing Specht modules for symmetric group over the complex field, and other fields. This is based on joint work with Chandler, Sazdanovic, and Stella.
Date:
-
Location:
POT 745`