Events

Title: Higher-order correlation inequalities for random spanning trees

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:00 pm.

Abstract: The connection between enumerating spanning trees of a graph and the theory of (linear) electrical networks goes all the way back to Kirchhoff's 1847 paper. It is physically sensible that if one increases the conductance of one wire in an electrical network, then the overall conductance of the network can not decrease. This corresponds to the less obvious fact that any two distinct edges are non-positively correlated, when one chooses a random spanning tree. Covariance is the 2-point "Ursell function'', and expectation is the 1-point Ursell function. For any subset of edges there is an associated Ursell function, and these are related to occupation probabilities by Möbius inversion. I will discuss some situations in which the signs of these Ursell functions can be predicted, yielding higher-order correlation inequalities for random spanning trees.

Title: Chromatic Number of Random Signed Graphs

Abstract: A signed graph is a graph where edges are labelled {+1,-1}. A signed colouring in 2k colours maps the vertices of a signed graph to {-k,...,-1,1,...,k}, such that neighbours joined by a positive edge do not share the same colour, and those joined by a negative edge do not share opposite colours. It is a classical result that the chromatic number of a G(n,p) Erdos-Renyi random graph is asymptotically almost surely n/(2log_b(n)), where p is constant and b=1/(1-p). We extend the method used there to prove that the chromatic number of a G(n,p,q) random signed graph, where q is the probability that an edge is labelled -1, is also a.a.s. n/(2log_b(n)), if p is constant and q=o(1).

Title: Snake decompositions of lattice path matroids

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:00 pm.

Abstract: We study Ehrhart theory of lattice path matroid polytopes motivated by a conjecture by De Loera, Haws and Köppe. More specifically, we aim to understand the h*-vector of this family of matroid polytopes. To do so, we subdivide them into smaller matroid polytopes such that each piece is a snake, which are matroids such that their matroid polytope coincides with the order polytope of a fence poset.

Title: The Chambolle-Pock algorithm revisited: splitting operator and its range with applications

Abstract: Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al. analyzed the behavior of PDHG when applied to an infeasible or unbounded instance of linear programming, and in particular, showed that PDHG is able to diagnose these conditions.

Title: Kemeny’s constant and random walks on graphs

Abstract: Kemeny's constant is an interesting and useful quantifier of how well-connected the states of a Markov chain are. This comes to the forefront when the Markov chain in question is a random walk on a graph, in which case Kemeny's constant is interpreted as a measure of how `well-connected' the graph is. Though it was first introduced in the 1960s, interest in this concept has recently exploded. This talk will provide an introduction to Markov chains, an overview of the history of Kemeny’s constant, discussion of some applications, and a survey of recent results, with an emphasis on those that are extensions or generalizations of simple random walks on graphs, to complement Sooyeong’s talk from two weeks ago.

Title: Extended Schur Functions and Bases Related by Involutions

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:00 pm.

Abstract: The extended Schur basis and the shin basis generalize the Schur functions to the dual algebras of the quasisymmetric functions and the noncommutative symmetric functions. We define a creation operator and a Jacobi-Trudi rule for certain shin functions and show that a similar matrix determinant expression does not exist for every shin function.

Title: The Tutte Polynomial, Bipartite Representations of Graphs, and Grid Walking 

Abstract: The Tutte Polynomial has many equivalent definitions. It can be defined by a deletion-contraction relation with the terms determined by the sequence of contractions, deletions, loops, and isthmi. This definition is independent of edge order. Another definition relies on a fixed edge ordering and examines the edge activities over maximal spanning forests. There is a direct relationship between edge activity and deletion/contraction for a given edge ordering. Furthermore, the monomials of the Tutte polynomial can be interpreted as grid walks. This allows for an approach to the Tutte polynomial on hypergraphs by examining the grid walks of the bipartite representation of the graph.

Title: Algorithmic Tools for Congressional Districting: Fairness via Analytics

Abstract: The American winner-take-all congressional district system empowers politicians to engineer electoral outcomes by manipulating district boundaries. To date, computational solutions mostly focus on drawing unbiased maps by ignoring political and demographic input, and instead simply optimize for compactness and other related metrics.

Title: Distance-regular graphs that support a uniform structure

Abstract: Given a connected bipartite graph $G$, the adjacency matrix $A$ of $G$ can be decomposed as  $A=L+R$, where $L=L(x)$ and $R=R(x)$ are respectively the  lowering and the raising matrices with respect to a certain vertex $x$. The graph $G$ has a \textit{uniform structure} with respect to $x$ if the matrices $RL^2$, $LRL$, $L^2R$, and $L$ satisfy a certain linear dependency.

Title: Linear relations and Lorentzian property of chromatic symmetric functions

There will be a pre-seminar presenting relevant background at the beginning graduate level starting at 1:00 pm.

Abstract: The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian Wachs q-analogue (q-CSF) have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are related to placements of non-attacking rooks by results of Stanley-Stembridge (1993) and Guay-Paquet (2013).