Pairs of Noncrossing Free Dyck Paths and Noncrossing Partitions

Simple item page
dc.creatorChen, William Y. C.
dc.creatorPang, Sabrina X. M.
dc.creatorQu, Ellen X. Y.
dc.creatorStanley, Richard P.
dc.date2008-04-18
dc.date2008-07-27
dc.date.accessioned2026-07-07T09:52:43Z
dc.date.available2026-07-07T09:52:43Z
dc.descriptionUsing 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.
dc.description9 pages, 5 figures, revised version, to appear in Discrete Mathematics
dc.identifierhttps://arxiv.org/abs/0804.2930
dc.identifierhttp://arxiv.org/abs/0804.2930
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165695
dc.subjectCombinatorics
dc.titlePairs of Noncrossing Free Dyck Paths and Noncrossing Partitions
dc.typetext

Files

Collections

arXiv