Cyclic sieving phenomenon in non-crossing connected graphs

Abstract

We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.

13 pages, 5 figures

Cited by in corpus (1)

• Cyclic Sieving for torsion pairs in the cluster category of Dynkin type A_n