Matrix ansatz and combinatorics of the $k$-species PASEP

We study a generalization of the partially asymmetric exclusion process (PASEP) in which there are $k$ species of particles of varying weights hopping right and left on a one-dimensional lattice of $n$ sites with open boundaries. In this process, only the heaviest particle type can enter on the left of the lattice and exit from the right of the lattice. In the bulk, two adjacent particles of different weights can swap places. We prove a Matrix Ansatz for this model, in which different rates for the swaps are allowed. Based on this Matrix Ansatz, we define a combinatorial object which we call a $k$-rhombic alternative tableau, which we use to give formulas for the steady state probabilities of the states of this $k$-species PASEP. We also describe a Markov chain on the 2-rhombic alternative tableaux that projects to the 2-species PASEP.