Acyclic flow polytopes and Kostant's partition function

Richard Stanley

MIT

December 3,
4:15pm
refreshments at 3:45pm
2-338

ABSTRACT 

For a finite acyclic digraph G we associate a convex polytope P called the *flow polytope* of G. We will discuss some of the interesting combinatorial properties of P, including unexpected connections with Kostant's partition function for the root system A_n. In particular, we will indicate how the theory of acyclic flow polytopes is an analogue of the theory of P-partitions.


Speaker's Contact Info: rstan(at-sign)math.mit.edu


Return to seminar home page

Combinatorics Seminar, Mathematics Department, MIT, sara(at-sign)math.mit.edu

Page loaded on October 19, 1999 at 04:19 PM. Copyright © 1998-99, Sara C. Billey. All rights reserved.