# Flow polytopes of signed graphs and the Kostant partition function

@article{Mszros2012FlowPO,
title={Flow polytopes of signed graphs and the Kostant partition function},
author={Karola M{\'e}sz{\'a}ros and Alejandro H. Morales},
journal={arXiv: Combinatorics},
year={2012}
}
• Published 1 August 2012
• Mathematics
• arXiv: Combinatorics
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…
Volumes and Ehrhart polynomials of flow polytopes
• Mathematics
Mathematische Zeitschrift
• 2019
The Lidskii formula for the type $$A_n$$An root system expresses the volume and Ehrhart polynomial of the flow polytope of the complete graph with nonnegative integer netflows in terms of Kostant
Flow Polytopes of Partitions
• Mathematics, Computer Science
Electron. J. Comb.
• 2019
This work defines a family of closely related flow polytopes and proves that there is a polytope (the limiting one in a sense) which is a product of scaled simplices, explaining their product volumes.
REFINEMENTS OF PRODUCT FORMULAS FOR VOLUMES OF FLOW POLYTOPES
Flow polytopes are an important class of polytopes in combinatorics whose lattice points and volumes have interesting properties and relations. The Chan–Robbins–Yuen (CRY) polytope is a flow polytope
A combinatorial model for computing volumes of flow polytopes
We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's
On Flow Polytopes, Order Polytopes, and Certain Faces of the Alternating Sign Matrix Polytope
• Computer Science, Mathematics
Discret. Comput. Geom.
• 2019
It is proved by proving that the members of a family of faces of the alternating sign matrix polytope which includes ASM-CRY are both order and flow polytopes.
Counting Integer Points of Flow Polytopes
• Computer Science, Mathematics
Discret. Comput. Geom.
• 2021
The goal of the present paper is to provide a fully geometric proof for the Ehrhart polynomial formula for flow polytopes, and to reveal the geometry of these formulas.
h-Polynomials via Reduced Forms
• K. Mészáros
• Mathematics, Computer Science
Electron. J. Comb.
• 2015