Abstract
We introduce and study new combinatorial objects called Dyck tableaux which may be seen as a variant of permutation tableaux. These objects appear in the combinatorial interpretation of the physical model PASEP (Partially Simple Asymmetric Exclusion Process). Dyck tableaux afford a simple recursive structure through the construction of an insertion algorithm. With this tool, we are able to describe statistics which are relevant in the PASEP model, in a more direct way than in previous works. Moreover, we give a new and natural link between permutations and certain labeled Dyck paths known as subdivided Laguerre histories.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.