Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Combinatorics of the ...
Conference paper

Combinatorics of the PASEP partition function

Matthieu Josuat-Vergès ORCID (1)
(1) Laboratoire de Recherche en Informatique
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
Proceedings
DOI
10.46298/dmtcs.2855
License
https://about.hal.science/hal-authorisation-v1
Indicators
602
Views
434
Downloads

Combinatorics of the PASEP partition function

Matthieu Josuat-Vergès ORCID (1)
(1) Laboratoire de Recherche en Informatique
Abstract
English
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.
French
Nous considérons un modèle de PASEP à trois paramètres sur $N$ sites. Une formule close pour la fonction de partition a été obtenue analytiquement par Blythe et al. Nous donnons une formule qui généralise celle de Blythe et al, prouvée combinatoirement de deux manières diffèrentes. Par ailleurs la première preuve peut être adaptée de sorte à obtenir les moments des polynômes d'Al-Salam-Chihara.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • asymmetric exclusion process
  • lattice paths
  • orthogonal polynomials
  • enumeration
Preview
Loading PDF preview...