Occupied corners in tree-like tableaux

From MaRDI portal
Publication:341335

zbMATH Open1350.05175arXiv1505.06098MaRDI QIDQ341335FDOQ341335


Authors: Patxi Laborde-Zubieta Edit this on Wikidata


Publication date: 16 November 2016

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: Tree-like tableaux are combinatorial objects that appear in a combinatorial understanding of the PASEP model from statistical mechanics. In this understanding, the corners of the Southeast border correspond to the locations where a particle may jump to the right. Such corners may be of two types: either empty or occupied. Our main result is the following: on average there is one occupied corner per tree-like tableau. We give two proofs of this, a short one which gives us a polynomial version of the result, and another one using a bijection between tree-like tableaux and permutations which gives us an additional information. Moreover, we obtain the same result for symmetric tree-like tableaux and we refine our main result to an equivalence class. Finally we present a conjecture enumerating corners, and we explain its consequences for the PASEP.


Full work available at URL: https://arxiv.org/abs/1505.06098

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (6)





This page was built for publication: Occupied corners in tree-like tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341335)