English

Flow polytopes of signed graphs and the Kostant partition function

Combinatorics 2015-10-21 v1

Abstract

We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni and Vergne using techniques of residues. In contrast with their approach, we provide entirely combinatorial proofs inspired by the work of Postnikov and Stanley on flow polytopes. As a fascinating special family of flow polytopes, we study the Chan-Robbins-Yuen polytopes. Motivated by the beautiful volume formula k=1n2Cat(k)\prod_{k=1}^{n-2} Cat(k) for the type AnA_n version, where Cat(k)Cat(k) is the kkth Catalan number, we introduce type Cn+1C_{n+1} and Dn+1D_{n+1} Chan-Robbins-Yuen polytopes along with intriguing conjectures pertaining to their properties.

Keywords

Cite

@article{arxiv.1208.0140,
  title  = {Flow polytopes of signed graphs and the Kostant partition function},
  author = {Karola Meszaros and Alejandro H. Morales},
  journal= {arXiv preprint arXiv:1208.0140},
  year   = {2015}
}

Comments

29 pages, 13 figures

R2 v1 2026-06-21T21:44:33.845Z