Flow polytopes of partitions

From MaRDI portal




Abstract: 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 for each partition shape lambda and netflow vector . In each such family, we prove that there is a polytope (the limiting one in a sense) which is a product of scaled simplices, explaining their product volumes. We also show that the combinatorial type of all polytopes in a fixed family is the same. When lambda is a staircase shape and is the all ones vector the latter result 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.









This page was built for publication: Flow polytopes of partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733929)