Rook placements in Young diagrams and permutation enumeration

Abstract

Given two operators D ˆ and E ˆ subject to the relation D ˆ E ˆ − q E ˆ D ˆ = p , and a word w in D ˆ and E ˆ , the rewriting of w in normal form is combinatorially described by rook placements in Young diagrams. We give enumerative results about these rook placements, particularly in the case where p = ( 1 − q ) / q 2 . This case naturally arises in the context of the PASEP, a random process whose partition function and stationary distribution can be derived using two operators D and E subject to the relation D E − q E D = D + E (matrix Ansatz). Using the link obtained by Corteel and Williams between the PASEP, permutation tableaux and permutations, we prove a conjecture of Corteel and Rubey about permutation enumeration. This result gives the generating function for permutations of given size with respect to the number of ascents and occurrences of the pattern 13-2, this is also the moments of some q-Laguerre orthogonal polynomials.