Answers are grounded in this paper and cite their sources.
We construct an involution on set partitions which keeps track of the numbers of crossings, nestings and alignments of two edges. We derive then the symmetric distribution of the numbers of crossings and nestings in partitions, which generalizes a recent result of Klazar and Noy in perfect matchings. By factorizing our involution through bijections between set partitions and some path diagrams we obtain the continued fraction expansions of the corresponding ordinary generating functions.
No takes yet. Share an insight, caveat, or question.
Kasraoui et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: