Corners in tree-like tableaux (Q727203)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6661378
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corners in tree-like tableaux |
scientific article; zbMATH DE number 6661378 |
Statements
Corners in tree-like tableaux (English)
0 references
6 December 2016
0 references
Summary: 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 off of 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.
0 references
tree-like tableaux
0 references
permutation tableaux
0 references
type-B permutation tableaux
0 references
0.986110270023346
0 references
0.9198206663131714
0 references
0.9103767275810242
0 references
0.8774080872535706
0 references
0.8689387440681458
0 references
