Flow polytopes of partitions

MaRDI QIDQ1733929zbMATH OpenFDO

Authors Karola Mészáros, Connor Simpson, Zoe Wellner

Publication date 22 March 2019

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.03100, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p47

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Flows in graphs (05C21) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

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.

Review text

Summary: 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 \(\mathcal F_{(\lambda,\mathbf{a})}\) for each partition shape \(\lambda\) and netflow vector \(\mathbf{a}\in \mathbb{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, explaining their product volumes. We also show that the combinatorial type of all polytopes in a fixed family \(\mathcal{F}_{(\lambda,\mathbf{a})}\) is the same. When \(\lambda\) is a staircase shape and \(\mathbf{a}\) is the all ones vector the latter results specializes to a theorem of the first author with Morales and Rhoades [\textit{K. Mészáros} et al., Sel. Math., New Ser. 23, No. 1, 425--454 (2017; Zbl 1355.05271)], which shows that the combinatorial type of the Tesler polytope is a product of simplices.

Recommendations

• On product formulas for volumes of flow polytopes
• Volumes and Ehrhart polynomials of flow polytopes
• The polytope of Tesler matrices
• Counting integer points of flow polytopes
• The polytope of Tesler matrices (extended abstract)

Cites work

• Flow polytopes of signed graphs and the Kostant partition function
• scientific article; zbMATH DE number 1431596 (Why is no real title available?)
• Kostant partitions functions and flow polytopes
• On the Volume of a Certain Polytope
• Quivers, cones and polytopes.
• The polytope of Tesler matrices

Cited in

(7)

• Kostant partitions functions and flow polytopes
• Volumes of flow polytopes related to caracol graphs
• Kostant's partition function and magic multiplex juggling sequences
• On volume functions of special flow polytopes associated to the root system of type \(A\)
• Volumes and Ehrhart polynomials of flow polytopes
• On product formulas for volumes of flow polytopes
• Flows on honeycombs and sums of Littlewood-Richardson tableaux

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)