A bijection between noncrossing and nonnesting partitions of types A and B

Details A bijection between noncrossing and nonnesting partitions of types A and B A bijection between noncrossing and nonnesting partitions of types A and B

2008-10-08

arxiv.org/abs/0810.1422v2

Contributions to Discrete Mathematics , Vol 6, No 2 (2011), 70-90

Mathematics

Combinatorics

11 pages, 11 figures. Inverse map described. Minor changes to correct typos and clarify content

Scientific paper

The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent number of nonnesting partitions. For type A, there are several bijective proofs of this equality, being the intuitive map that locally converts each crossing to a nesting one of them. In this paper we present a bijection between nonnesting and noncrossing partitions of types A and B that generalizes the type A bijection that locally converts each crossing to a nesting.

Affiliated with

Also associated with

No associations

Rating

A bijection between noncrossing and nonnesting partitions of types A and B does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A bijection between noncrossing and nonnesting partitions of types A and B, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bijection between noncrossing and nonnesting partitions of types A and B will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30046