Abstract
The number of noncrossing partitions of $\{1,2,\ldots,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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Combinatorics and braid varieties;Proceedings of Symposia in Pure Mathematics;2024
2. Descents on nonnesting multipermutations;European Journal of Combinatorics;2023-10
3. Weyl Group $${\varvec{q}}$$ q -Kreweras Numbers and Cyclic Sieving;Annals of Combinatorics;2018-11-13
4. Modular Catalan numbers;European Journal of Combinatorics;2017-03
5. NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON;Forum of Mathematics, Sigma;2017