On Flow Polytopes, Order Polytopes, and Certain Faces of the Alternating Sign Matrix Polytope

We study an alternating sign matrix analogue of the Chan–Robbins–Yuen polytope, which we call the ASM-CRY polytope. We show that this polytope has Catalan many vertices and its volume is equal to the number of standard Young tableaus of staircase shape; we also determine its Ehrhart polynomial. We achieve the previous 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. Inspired by the above results, we relate three established triangulations of order and flow polytopes, namely Stanley’s triangulation of order polytopes, the Postnikov–Stanley triangulation of flow polytopes and the Danilov–Karzanov–Koshevoy triangulation of flow polytopes. We show that when a graph G is a planar graph, in which case the flow polytope $${{\mathcal {F}}}_G$$FG is also an order polytope, Stanley’s triangulation of this order polytope is one of the Danilov–Karzanov–Koshevoy triangulations of $${{\mathcal {F}}}_G$$FG. Moreover, for a general graph G we show that the set of Danilov–Karzanov–Koshevoy triangulations of $${{\mathcal {F}}}_G$$FG equals the set of framed Postnikov–Stanley triangulations of $${{\mathcal {F}}}_G$$FG. We also describe explicit bijections between the combinatorial objects labeling the simplices in the above triangulations.

[1]  Robert A. Proctor New Symmetric Plane Partition Identities from Invariant Theory Work of De Concini and Procesi , 1990, Eur. J. Comb..

[2]  Richard P. Stanley,et al.  Two poset polytopes , 1986, Discret. Comput. Geom..

[3]  David P. Robbins,et al.  Alternating Sign Matrices and Descending Plane Partitions , 1983, J. Comb. Theory, Ser. A.

[4]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[5]  David P. Robbins,et al.  On the Volume of a Certain Polytope , 1998, Exp. Math..

[6]  Daniel J. Katz,et al.  Proof of a Conjecture of , 2011 .

[7]  Avery St. Dizier,et al.  From generalized permutahedra to Grothendieck polynomials via flow polytopes , 2017, Algebraic Combinatorics.

[8]  G. Gallo,et al.  Extreme points and adjacency relationship in the flow polytope , 1978 .

[9]  R. Yoshida,et al.  A generating function for all semi-magic squares and the volume of the Birkhoff polytope , 2009 .

[10]  Sergey Fomin,et al.  Reduced Words and Plane Partitions , 1997 .

[11]  Coherent fans in the space of flows in framed graphs , 2012 .

[12]  Sergey Kitaev,et al.  Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II , 2015, Integers.

[14]  Doron Zeilberger Proof of a Conjecture of Chan, Robbins, and Yuen , 1998 .

[15]  yuliy baryshnikov,et al.  Enumeration formulas for young tableaux in a diagonal strip , 2007, 0709.0498.

[16]  Vincent A. Knight,et al.  Higher Spin Alternating Sign Matrices , 2007, Electron. J. Comb..

[17]  Jessica Striker,et al.  The Alternating Sign Matrix Polytope , 2007, Electron. J. Comb..

[18]  A. Schrijver A Course in Combinatorial Optimization , 1990 .

[19]  S. Robins,et al.  Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra , 2007 .

[20]  M. Vergne,et al.  Kostant Partitions Functions and Flow Polytopes , 2008 .

[21]  Brendan D. McKay,et al.  The asymptotic volume of the Birkhoff polytope , 2007, 0705.2422.

[22]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[23]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[24]  R. Stanley What Is Enumerative Combinatorics , 1986 .

[25]  Doron Zeilberger The Ehrhart polynomial of the Birkhoff polytope , 2004 .