Combinatorics of the three-parameter PASEP partition function (Q625385)

Summary: We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by \textit{R.A. Blythe}, \textit{M.R. Evans}, \textit{F. Colaiori}, and \textit{F.H.L. Essler} [``Exact solution of a partially asymmetric exclusion model using a deformed oscillator algebra,'' J. Phys. A, Math. Gen. 33, No. 12, 2313--2332 (2000; Zbl 1100.82512)]. It is known to be a generating function of permutation tableaux by the combinatorial interpretation of \textit{S. Corteel} and \textit{L.K. Williams} [``Tableaux combinatorics for the asymmetric exclusion process,'' Adv. Appl. Math. 39, No.\,3, 293--310 (2007; Zbl 1129.05057)]. We prove bijectively two new combinatorial interpretations. The first one is in terms of weighted Motzkin paths called Laguerre histories and is obtained by refining a bijection of \textit{D. Foata} and \textit{D. Zeilberger} [``Denert's permutation statistic is indeed Euler-Mahonian,'' Stud. Appl. Math. 83, No.\,1, 31--59 (1990)]. Secondly we show that this partition function is the generating function of permutations with respect to right-to-left minima, right-to-left maxima, ascents, and 31-2 patterns, by refining a bijection of \textit{J. Françon} and \textit{X.G. Viennot} [``Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi,'' Discrete Math. 28, 21--35 (1979; Zbl 0409.05003)]. Then we give a new formula for the partition function which generalizes the one of Blythe et. al. [loc. cit.] It is proved in two combinatorial ways. The first proof is an enumeration of lattice paths which are known to be a solution of the Matrix Ansatz of \textit{B. Derrida}, \textit{M.R. Evans}, \textit{V. Hakim}, and \textit{V. Pasquier} [``Exact solution of a 1D asymmetric exclusion model using a matrix formulation,'' J. Phys. A, Math. Gen. 26, No.7, 1493-1517 (1993; Zbl 0772.60096)]. The second proof relies on a previous enumeration of rook placements, which appear in the combinatorial interpretation of a related normal ordering problem. We also obtain a closed formula for the moments of Al-Salam- Chihara polynomials.