Erratum to ``Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials'' (Q394824)

From MaRDI portal
scientific article; zbMATH DE number 5960758
  • Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials
Language Label Description Also known as
English
Erratum to ``Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials''
scientific article; zbMATH DE number 5960758
  • Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials

Statements

Erratum to ``Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials'' (English)
0 references
Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials (English)
0 references
0 references
0 references
27 January 2014
0 references
21 October 2011
0 references
asymmetric exclusion process
0 references
stationary distribution
0 references
Askey-Wilson polynomial
0 references
moment
0 references
Young diagram
0 references
staircase tableau
0 references
matrix ansatz
0 references
The asymmetric exclusion process (ASEP) is an important model from statistical dynamics that describes a system of interacting particles hopping left and right on a one-dimensional lattice of \(n\) sites. It is a primitive model for traffic flow, translation in protein synthesis and formation of shocks. The authors consider a one-dimensional lattice of \(n\) sites with open boundaries. Particles may enter from the left (resp. right) at rate \(\alpha\,dt\) (resp. \(\delta\,dt\)), and exit to the left (resp. right) at rate \(\beta\,dt\) (resp. \(\gamma\,dt\)). The probability of hopping left and right is \(qdt\) and \(udt\), respectively. Since 1982, connections between this model and combinatorics have been observed, and the authors give a complete solution to two problems that arise in this context: {\parindent=7mm \begin{itemize}\item[(a)]To find a combinatorial description of the stationary distribution, i.e., to express each component of the stationary distribution as a generating function for a set of combinatorial objects. \item[(b)]To find combinatorial formulas for the moments of (the weight functions of) the Askey-Wilson polynomials. \end{itemize}} They introduce a new combinatorial object, the staircase tableau (Definition 3.1), and prove (Theorem 3.4) that the generating functions for staircase tableaux describe the stationary distribution of the ASEP, with all parameters general. Because of the link to the ASEP, staircase tableaux have symmetries not apparent from their definition. The authors use Theorem 3.4, together with an earlier result of \textit{M. Uchiyama}, \textit{T. Sasamoto} and \textit{M. Wadati} [``Asymmetric simple exclusion process with open boundaries and Askey-Wilson polynomials,'' J. Phys. A, Math. Gen. 37, No.\,18, 4985--5002 (2004; Zbl 1047.82019)] linking an ASEP with open boundaries to Askey-Wilson polynomials, to give a combinatorial formula for the moments of the Askey-Wilson polynomials (Theorem 4.2). The method of proof for Theorem 3.4 builds on work 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)] who introduce a matrix ansatz as a tool for understanding the stationary distribution: if there are matrices and vectors satisfying certain relations (the DEHP algebra), then each component of the stationary distribution of the ASEP can be expressed in terms of certain products of these matrices and vectors. This cannot be used when all parameters are general, so the authors introduce a slight generalization of the matrix ansatz (Theorem 5.2), in which it is necessary to check not three identities, but three infinite families of identities. The process is complicated because the matrices and vectors have four and two indices, respectively (Section 6.1). Important concepts in the article are illustrated with examples, and several open problems are stated in Section 8.
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references