A uniform bijection between nonnesting and noncrossing partitions

Details A uniform bijection between nonnesting and noncrossing partitions A uniform bijection between nonnesting and noncrossing partitions

2011-01-06

arxiv.org/abs/1101.1277v2

Mathematics

Combinatorics

29 pages, 7 figures, added proofs of several Panyushev Conjectures, minor errors and typos corrected

Scientific paper

In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing partitions, and hence construct the first uniform bijection between nonnesting and noncrossing partitions. Unfortunately, the proof that our construction is well-defined is case-by-case, using a computer in the exceptional types. Fortunately, the proof involves new and interesting combinatorics in the classical types. As consequences, we prove several conjectural properties of the Panyushev map, and we prove two cyclic sieving phenomena conjectured by D. Bessis and V. Reiner.

Affiliated with

Also associated with

No associations

Rating

A uniform bijection between nonnesting and noncrossing partitions 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 uniform bijection between nonnesting and noncrossing partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A uniform bijection between nonnesting and noncrossing partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-400027