Alan Guo
-
Cyclic sieving phenomenon in non-crossing connected graphs
dmtcs:2923 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2011,
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
-
https://doi.org/10.46298/dmtcs.2923
Cyclic sieving phenomenon in non-crossing connected graphs
Authors: Alan Guo 1
NULL
Alan Guo
1 Department of Mathematics [Durham]
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 S.-P. Eu.