Combinatorics of the asymmetric exclusion process on a semi-infinite lattice (Q2345756)

The asymmetric exclusion process is a Markov process in which particles hop on a lattice, subject to the condition that there is at most one particle per site. The paper under review studies two versions of this process: on a semi-infinite lattice \(\mathbb Z^+\), and on a finite interval in \(\mathbb Z\). In each case one specifies rates at which particles move left or right, or enter and exit at the boundaries. The main results concern the stationary measures for these models, which admit combinatorial formulæ in terms of staircase tableaux. The paper appears to be carefully written and referenced, and is focussed on proving its main results and as such is directed at experts. The relative outsider is not likely to be drawn into the subject by this paper. On the other hand, the references provide plenty of background, so this should not be taken as a criticism.