Combinatorics of the three-parameter PASEP partition function

zbMATH Open1205.05011arXiv0912.1279MaRDI QIDQ625385FDOQ625385

Authors: Matthieu Josuat-Vergés 

Publication date: 17 February 2011

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

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.

Full work available at URL: https://arxiv.org/abs/0912.1279

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

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

zbMATH Keywords

generating functionpartition functionpermutation tableauxpartially asymmetric exclusion process

Mathematics Subject Classification ID

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

Cited In (20)

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

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)