Flow Polytopes of Partitions

Karola Mészáros, Connor Simpson, Zoe Wellner
2019 Electronic Journal of Combinatorics  
Recent progress on flow polytopes indicates many interesting families with product formulas for their volume. These product formulas are all proved using analytic techniques. Our work breaks from this pattern. We define a family of closely related flow polytopes $F_{(\lambda, {\bf a})}$ for each partition shape $\lambda$ and netflow vector ${\bf a}\in Z^n_{> 0}$. In each such family, we prove that there is a polytope (the limiting one in a sense) which is a product of scaled simplices,
more » ... simplices, explaining their product volumes. We also show that the combinatorial type of all polytopes in a fixed family $F_{(\lambda, {\bf a})}$ is the same. When $\lambda$ is a staircase shape and ${\bf a}$ is the all ones vector the latter results specializes to a theorem of the first author with Morales and Rhoades, which shows that the combinatorial type of the Tesler polytope is a product of simplices.
doi:10.37236/8114 fatcat:z3wet6wmkbeohjph5yawejci4a