Title of article
Pairs of noncrossing free Dyck paths and noncrossing partitions
Author/Authors
Chen، نويسنده , , William Y.C. and Pang، نويسنده , , Sabrina X.M. and Qu، نويسنده , , Ellen X.Y. and Stanley، نويسنده , , Richard P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
2834
To page
2838
Abstract
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2 n and noncrossing partitions of [ 2 n + 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
Vacillating tableau , Dyck path , Plane partition , Free Dyck path , Noncrossing partition
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598765
Link To Document