Combinatorics of the three-parameter PASEP partition function

MaRDI QIDQ625385zbMATH OpenFDO

Authors Matthieu Josuat-Vergés

Publication date 17 February 2011

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

Full work available at URL https://arxiv.org/abs/0912.1279, https://eudml.org/doc/229708, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p22.html

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

zbMATH Keywords

generating functionpartially asymmetric exclusion processpartition functionpermutation tableaux

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial probability (60C05) Exactly solvable models; Bethe ansatz (82B23)

Abstract: 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 Blythe, Evans, Colaiori, and Essler. It is known to be a generating function of permutation tableaux by the combinatorial interpretation of Corteel and Williams. 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 Foata and Zeilberger. 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 Francon and Viennot. Then we give a new formula for the partition function which generalizes the one of Blythe & al. 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 Derrida & al. 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.

Review text

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.

Recommendations

• scientific article; zbMATH DE number 6806792
• Tableaux combinatorics for the asymmetric exclusion process
• Matrix Ansatz, lattice paths and rook placements
• A Markov Chain on Permutations which Projects to the PASEP

Cited in

(20)

• 2-species exclusion processes and combinatorial algebras
• Enumeration formulas for generalized \(q\)-Euler numbers
• Block decomposition and statistics arising from permutation tableaux
• Asymmetric simple exclusion process with open boundaries and quadratic harnesses
• Moments of Askey-Wilson polynomials
• Tableaux combinatorics for the asymmetric exclusion process
• Formulae for Askey-Wilson moments and enumeration of staircase tableaux
• Continued fractions and the partially asymmetric exclusion process
• Dyck tableaux
• Stammering tableaux
• scientific article; zbMATH DE number 6806792 (Why is no real title available?)
• Combinatorial mappings of exclusion processes
• Multivariate Eulerian polynomials and exclusion processes
• Rook placements in Young diagrams and permutation enumeration
• Asymptotic normality of pattern counts in conjugacy classes
• Approximating the stationary distribution of the ASEP with open boundaries
• Standard Jordan partitions with three parameters
• A \(q\)-analog of Schläfli and Gould identities on Stirling numbers
• Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations
• Combinatorial Hopf algebras, noncommutative Hall-Littlewood functions, and permutation tableaux

This page was built for publication: Combinatorics of the three-parameter PASEP partition function

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