Enumeration of corners in tree-like tableaux
From MaRDI portal
Publication:2965989
Abstract: In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type ) permutation tableaux and (symmetric) alternative tableaux. The proof is based on Corteel and Nadeau's bijection between permutation tableaux and permutations. It allows us to interpret the number of corners as a statistic over permutations that is easier to count. The type case uses the bijection of Corteel and Kim between type permutation tableaux and signed permutations. Moreover, we give a bijection between corners and runs of size 1 in permutations, which gives an alternative proof of the enumeration of corners. Finally, we introduce conjectural polynomial analogues of these enumerations, and explain the implications on the PASEP.
Recommendations
Cited in
(9)- Occupied corners in tree-like tableaux
- Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process
- Distribution of the number of corners in tree-like and permutation tableaux
- Corners in tree-like tableaux
- The tree structure in staircase tableaux
- Corners in tree-like tableaux
- Combinatorics on permutation tableaux of type A and type B
- Refined enumeration of corners in tree-like tableaux
- Signed enumeration of upper-right corners in path shuffles
This page was built for publication: Enumeration of corners in tree-like tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965989)