Enumeration of corners in tree-like tableaux

zbMATH Open1400.05012arXiv1511.05456MaRDI QIDQ2965989FDOQ2965989

Authors: Alice L. L. Gao, Emily X. L. Gao, Patxi Laborde-Zubieta, Brian Y. Sun 

Publication date: 3 March 2017

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 $B$) 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 $B$ case uses the bijection of Corteel and Kim between type $B$ 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.

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

Recommendations

• Corners in tree-like tableaux
• Corners in tree-like tableaux
• Refined enumeration of corners in tree-like tableaux
• Occupied corners in tree-like tableaux
• Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process

zbMATH Keywords

permutationssigned permutationspermutation tableauxalternative tableauxtree-like tableauxsymmetric alternative tableauxsymmetric tree-like tableauxtype B permutation tableaux

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorial identities, bijective combinatorics (05A19)

Cited In (9)

• The tree structure in staircase tableaux
• Refined enumeration of corners in tree-like tableaux
• Corners in tree-like tableaux
• Corners in tree-like tableaux
• Combinatorics on permutation tableaux of type A and type B
• Signed enumeration of upper-right corners in path shuffles
• 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

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)