Cyclic sieving of noncrossing partitions for complex reflection groups

TL;DR

This paper demonstrates a specific case of the cyclic sieving phenomenon in the setting of noncrossing partitions associated with well-generated complex reflection groups, expanding understanding of symmetry in algebraic combinatorics.

Contribution

It establishes a new instance of cyclic sieving for noncrossing partitions in complex reflection groups, linking combinatorics and algebraic structures.

Findings

Proves cyclic sieving phenomenon for a class of complex reflection groups.

Connects noncrossing partitions with algebraic symmetry properties.

Enhances understanding of combinatorial structures in algebraic contexts.

Abstract

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.