Cyclic Sieving of Noncrossing Partitions for Complex Reflection Groups
By David Bessis, Victor Reiner. 2007
71 citations recorded by the source corpus.
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics
View Paper: https://www.semanticscholar.org/paper/f9a03756502238e154d45968eb71134a0fd9e7d4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Henning Krause
- Andrew Hubery
- Christian Stump
- Drew Armstrong
- Hugh Thomas
- I. Reiten
- Lingyan Guo
- B. Keller
In Mathematical Physics
- Andrew Hubery
- Henning Krause
- Drew Armstrong
- Christian Stump
- Hugh Thomas
- Apostolos Beligiannis
- B. Keller
- Xiao-Wu Chen
Citations in the corpus
- A categorification of non-crossing partitions (2013, background): “6] as well as [5] and the references therein.”
- Finite complex reflection arrangements are $K(\pi,1)$ (2006, unknown): “5 in [9], proved in [39]).”
- A uniform bijection between nonnesting and noncrossing partitions (2011, background): “Bessis and Reiner recently showed that the action of the Coxeter element on non-crossing partitions together with a remarkable q -extension of the Catalan numbers Cat( W ) exhibits the CSP: define the q -Catalan number where [ k ] q = 1 + q + q 2 + · · · + q k − 1 is the usual q -integer .”