Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a q, t-Narayana polynomial

We classify recurrent configurations of the sandpile model on the complete bipartite graph K"m","n in which one designated vertex is a sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is an mxn rectangle. Several special types of recurrent configurations and their properties via this bijection are examined. For example, recurrent configurations whose sum of heights is minimal are shown to correspond to polyominoes of least area. Two other classes of recurrent configurations are shown to be related to bicomposition matrices, a matrix analogue of set partitions, and (2+2)-free partially ordered sets. A canonical toppling process for recurrent configurations gives rise to a path within the associated parallelogram polyominoes. This path bounces off the external edges of the polyomino, and is reminiscent of [email protected]?s well-known bounce statistic for Dyck paths. We define a collection of polynomials that we call q,t-Narayana polynomials, defined to be the generating function of the bistatistic (area,parabounce) on the set of parallelogram polyominoes, akin to the (area,hagbounce) bistatistic defined on Dyck paths in Haglund (2003). In doing so, we have extended a bistatistic of Egge et al. (2003) to the set of parallelogram polyominoes. This is one answer to their question concerning extensions to other combinatorial objects. We conjecture the q,t-Narayana polynomials to be symmetric and prove this conjecture for numerous special cases. We also show a relationship between [email protected]?s (area,hagbounce) statistic on Dyck paths, and our bistatistic (area,parabounce) on a sub-collection of those parallelogram polyominoes living in a (n+1)xn rectangle.

[1]  Anders Claesson,et al.  Partition and composition matrices , 2011, J. Comb. Theory, Ser. A.

[2]  James Haglund.  Conjectured statistics for the q,t-Catalan numbers , 2003 .

[3]  Adriano M. Garsia,et al.  A proof of the q, t-Catalan positivity conjecture , 2002, Discret. Math..

[4]  Robert Cori,et al.  The sand-pile model and Tutte polynomials , 2003, Adv. Appl. Math..

[5]  D. Dhar.  Theoretical studies of self-organized criticality , 2006 .

[6]  Mireille Bousquet-Mélou,et al.  A method for the enumeration of various classes of column-convex polygons , 1996, Discret. Math..

[7]  Denis Chebikin,et al.  A family of bijections between G-parking functions and spanning trees , 2003, J. Comb. Theory A.

[8]  Robert Cori,et al.  On the Sandpile Group of Dual Graphs , 2000, Eur. J. Comb..

[9]  James Haglund,et al.  The q, t-Catalan numbers and the space of diagonal harmonics : with an appendix on the combinatorics of Macdonald polynomials , 2007 .

[10]  Vít Jelínek,et al.  Composition Matrices, (2+2)-Free Posets and their Specializations , 2011, Electron. J. Comb..

[11]  James Haglund,et al.  A Schröder Generalization of Haglund's Statistic on Catalan Paths , 2003, Electron. J. Comb..

[12]  Sergey Kitaev,et al.  (2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations , 2008, J. Comb. Theory, Ser. A.

[13]  Emeric Gioan,et al.  Activity preserving bijections between spanning trees and orientations in graphs , 2005, Discret. Math..

[14]  Criel Merino López.  Chip firing and the tutte polynomial , 1997 .

[15]  A. Garsia,et al.  A Remarkable q, t-Catalan Sequence and q-Lagrange Inversion , 1996 .

[16]  Etienne Rassart,et al.  Enumeration of Symmetry Classes of Parallelogram Polyominoes , 1999 .

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[18]  Robert Cori,et al.  Enumeration of (p, q)-parking functions , 2002, Discret. Math..

[19]  Mark Dukes,et al.  Ascent Sequences and Upper Triangular Matrices Containing Non-Negative Integers , 2009, Electron. J. Comb..

[20]  Olivier Bernardi.  Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings , 2008, Electron. J. Comb..

[21]  A M Garsia,et al.  A positivity result in the theory of Macdonald polynomials , 2001, Proceedings of the National Academy of Sciences of the United States of America.