Name
Abstract | ||
|---|---|---|
In this paper, we study tree-like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of corners in tree-like tableaux and the total number of corners in symmetric tree-like tableaux. In this paper, we prove both conjectures. Our proofs are based on the bijection with permutation tableaux or type-B permutation tableaux and consequently, we also prove results for these tableaux. In addition, we derive the limiting distribution of the number of occupied corners in random tree-like tableaux and random symmetric tree-like tableaux. |
Year | Venue | Keywords |
|---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | tree-like tableaux, permutation tableaux, type-B permutation tableaux |
DocType | Volume | Issue |
Journal | 23 | 4 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
3 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Hitczenko | 1 | 52 | 15.48 |
| amanda lohss | 2 | 0 | 0.68 |