Simple Asymmetric Exclusion Model and Lattice Paths: Bijections and   Involutions
  We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of weighted lattice paths which, when summed over, give the stationary state probability distribution. We show that all three sets of paths are combinatorially related via sequences of bijections and sign reversing involutions. 
Richard Brak and John Essam
math.CO math-ph math.MP