首页 | 本学科首页   官方微博 | 高级检索  
     


Pairs of noncrossing free Dyck paths and noncrossing partitions
Authors:William Y.C. Chen  Sabrina X.M. Pang
Affiliation:a Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin 300071, PR China
b Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Abstract:Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n+1] with n+1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
Keywords:Dyck path   Free Dyck path   Plane partition   Noncrossing partition   Vacillating tableau
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号