Matthieu Josuat-Vergès - Combinatorics of the PASEP partition function

dmtcs:2855 - Discrete Mathematics & Theoretical Computer Science, January 1, 2010, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) - https://doi.org/10.46298/dmtcs.2855
Combinatorics of the PASEP partition function

Authors: Matthieu Josuat-Vergès ORCID-iD1

  • 1 Laboratoire de Recherche en Informatique

We consider a three-parameter PASEP model on $N$ sites. A closed formula for the partition function was obtained analytically by Blythe et al. We give a new formula which generalizes the one of Blythe et al, and is proved in two combinatorial ways. Moreover the first proof can be adapted to give the moments of Al-Salam-Chihara polynomials.

https://doi.org/10.46298/dmtcs.2855
Source: HAL:hal-01186283v1
Volume: DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Section: Proceedings
Published on: January 1, 2010
Imported on: January 31, 2017
Keywords: asymmetric exclusion process,lattice paths,orthogonal polynomials,enumeration,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV math/0402376
Source : ScholeXplorer IsRelatedTo DOI 10.1016/j.jcta.2005.07.012
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.math/0402376
  • math/0402376
  • 10.1016/j.jcta.2005.07.012
  • 10.48550/arxiv.math/0402376
Rook numbers and the normal ordering problem

Share and export

Consultation statistics

This page has been seen 143 times.
This article's PDF has been downloaded 126 times.