Yan, Sherry H. F. and Zhou, Robin D. P. - Refined Enumeration of Corners in Tree-like Tableaux

dmtcs:3937 - Discrete Mathematics & Theoretical Computer Science, September 26, 2017, Vol 19 no. 3
Refined Enumeration of Corners in Tree-like Tableaux

Authors: Yan, Sherry H. F. and Zhou, Robin D. P.

Tree-like tableaux are certain fillings of Ferrers diagrams originally introduced by Aval et al., which are in simple bijections with permutation tableaux coming from Postnikov's study of totally nonnegative Grassmanian and alternative tableaux introduced by Viennot. In this paper, we confirm two conjectures of Gao et al. on the refined enumeration of non-occupied corners in tree-like tableaux and symmetric tree-like tableaux via intermediate structures of alternative tableaux, linked partitions, type $B$ alternative tableaux and type $B$ linked partitions.


Source : oai:arXiv.org:1701.07216
Volume: Vol 19 no. 3
Section: Combinatorics
Published on: September 26, 2017
Submitted on: September 4, 2017
Keywords: Mathematics - Combinatorics


Share

Browsing statistics

This page has been seen 71 times.
This article's PDF has been downloaded 45 times.