Matrix Ansatz, lattice paths and rook placements

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP. Besides other interpretations, this formula gives the generating function for permutations of a given size with respect to the number of ascents and occurrences of the pattern 13-2, the generating function according to weak exceedances and crossings, and the n th moment of certain q-Laguerre polynomials. © 2009 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France.

Cite

CITATION STYLE

APA

Corteel, S., Josuat-Vergès, M., Prellberg, T., & Rubey, M. (2009). Matrix Ansatz, lattice paths and rook placements. In FPSAC’09 - 21st International Conference on Formal Power Series and Algebraic Combinatorics (pp. 313–324). https://doi.org/10.46298/dmtcs.2751

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free