Refined Enumeration of Corners in Tree-like Tableaux
Refined Enumeration of Corners in Tree-like Tableaux
复制标题
树状画面中角点的精细枚举
DOI：
--
复制
发表时间：
--
影响因子：
0.7
通讯作者：
Robin D.P. Zhou
中科院分区：
文献类型：
--
作者：
Sherry H.F. Yan;Robin D.P. Zhou
树状图是对费勒斯图的某些填充，最初由Aval等人引入，它们是由Postnikov对完全非负Grassmanian的研究和Viennot引入的置换表的简单双射。本文通过交错tableaux、连接划分、B型交错tableaux和B型连接划分的中间结构，证实了Gao等人关于树形tableaux和对称树形tableaux中非占用角点的精确计数的两个定理。
Tree-like tableaux are certain fillings of Ferrers diagrams originally introduced by Aval et al., which are in simple bi-.jections 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.