Skip to Main content Skip to Navigation
Conference papers

Cyclic sieving phenomenon in non-crossing connected graphs

Abstract : 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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01215104
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, October 13, 2015 - 3:06:51 PM
Last modification on : Tuesday, August 20, 2019 - 5:12:02 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:19:46 AM

File

dmAO0139.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01215104, version 1

Collections

Citation

Alan Guo. Cyclic sieving phenomenon in non-crossing connected graphs. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.435-444. ⟨hal-01215104⟩

Share

Metrics

Record views

204

Files downloads

684