A combinatorial model for computing volumes of flow polytopes
Abstract
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 generalization of a volume formula originally due to Lidskii. We recover known flow polytope volume formulas and prove new volume formulas for flow polytopes that were seemingly unapproachable. A highlight of our model is an elegant formula for the flow polytope of a graph we call the caracol graph. As by-products of our work, we uncover a new triangle of numbers that interpolates between Catalan numbers and the number of parking functions, we prove the log-concavity of rows of this triangle along with other sequences derived from volume computations, and we introduce a new Ehrhart-like polynomial for flow polytope volume and conjecture product formulas for the polytopes we consider.
Cite
@article{arxiv.1801.07684,
title = {A combinatorial model for computing volumes of flow polytopes},
author = {Carolina Benedetti and Rafael S. González D'León and Christopher R. H. Hanusa and Pamela E. Harris and Apoorva Khare and Alejandro H. Morales and Martha Yip},
journal= {arXiv preprint arXiv:1801.07684},
year = {2021}
}
Comments
34 pages, 15 figures. v2: updated after referee reports; includes a proof of Proposition 8.7. Accepted into Transactions of the AMS