arXiv Analytics

Sign in

arXiv:1505.06098 [math.CO]AbstractReferencesReviewsResources

Occupied corners in tree-like tableaux

Patxi Laborde Zubieta

Published 2015-05-22Version 1

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.

Comments: 16 pages, 10 figures
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1410.4819 [math.CO] (Published 2014-10-17)
Some instances of Homomesy in product of two chains
arXiv:1504.04685 [math.CO] (Published 2015-04-18)
On the representation theory of $G\sim S_n$
arXiv:math/0309238 [math.CO] (Published 2003-09-15, updated 2005-10-06)
Finitely labeled generating trees and restricted permutations