Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649884 | Discrete Mathematics | 2009 | 5 Pages |
Abstract
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n2n and noncrossing partitions of [2n+1][2n+1] with n+1n+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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
William Y.C. Chen, Sabrina X.M. Pang, Ellen X.Y. Qu, Richard P. Stanley,