Discrete CATS Seminar
####
**
**#####
U N I V E R S I T Y
O F
K E N T U C K Y

DISCRETE
CATS
SEMINAR

WHERE CATS =
COMBINATORICS,
ALGEBRA,
TOPOLOGY
&
STATISTICS!

845 PATTERSON OFFICE TOWER

2011 - 2012

##
"Enumeration of integer solutions to linear inequalities
defined by digraphs"

Clifford Taylor

University of Kentucky

###
Monday, November 7, 2011

4:00 pm

845 POT

####
Abstract:

Many interesting families of constraints, including
ordinary partitions and compositions, plane partitions, plane
partition diamonds, and generalizations can be represented by
a directed graph. In this talk, we will introduce and use a
set of tools known as the 5 Guidelines to derive generating
function identities for constraint systems represented in this
manner. Also, we will briefly discuss the connection between
linear inequalities defined by digraphs and Stanley's theory
of P-partitions. This talk is based on a paper by Davis, D'Souza
Lee, and Savage.