Sciweavers

COMBINATORICS
1998

On Noncrossing and Nonnesting Partitions for Classical Reflection Groups

13 years 11 months ago
On Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C, defined recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of our tools come from the theory of hyperplane arrangements. Submitted: January 30, 1998; Accepted: September 10, 1998
Christos A. Athanasiadis
Added 21 Dec 2010
Updated 21 Dec 2010
Type Journal
Year 1998
Where COMBINATORICS
Authors Christos A. Athanasiadis
Comments (0)