Multivariate flow and tension polynomials of graphs
MSRIUP 2012: Enumerative Combinatorics June 16, 2012  July 29, 2012
Location: SLMath: Baker Board Room
msriup20129am
Flows and tensions of graphs are somewhat analogous to colorings, but one labels edges. Let's be more precise.Given a graph, orient it (i.e., give each edge an orientation) in some arbitrary but fixed way. A flow is a labelling of the edgessuch that at each node v, the sum of the labels at edges pointing towards v equals the sum of the labels at edges pointing away from v.A tension is a labelling of the edges such that the sum of the labels on any cycle of the graph (taken with signs given by theorientations of the edges of the cycle) is zero.One is typically interested in nowherezero flows and tensions, i.e., we're not allowed to use the label 0 anywhere.Some fairly recent theorems of Kochol and Chen say that if the flow/tension labelsare integers between k and k, the number of nowherezero flows/tensions is a polynomial in k.Moreover, there are interpretations of these polynomials when they are evaluated at negative integers; these are reciprocity theorems due to BeckZaslavsky, and ChenStanley.We will try to generalize these counting functions to the multivariable case, i.e., for each edge e, we are allowed to use labelsbetween ke and ke, for some given values ke.Now the flow and tension counting functions depend on several variables ke (one for each edge of the graph). We will study these counting functions.
msriup20129am
Quicktime 
msriup20129am.mov

Download 
H.264 Video 
msriup20129am.m4v

Download 
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.