Cyclic sieving phenomenon in non-crossing connected graphs (Q625371)

Summary: A non-crossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a \(q\)-binomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as conjectured by \textit{S.-P. Eu} [``The cyclic sieving phenomenon for faces of generalized cluster complexes,'' Adv. Appl. Math.40, No.\,3, 350--376 (2008; Zbl 1147.05014)].