Cyclic sieving phenomenon in non-crossing connected graphs
International audience 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 phen...
Main Author: | |
---|---|
Other Authors: | , , , , , |
Format: | Conference Object |
Language: | English |
Published: |
HAL CCSD
2011
|
Subjects: | |
Online Access: | https://hal.inria.fr/hal-01215104 https://hal.inria.fr/hal-01215104/document https://hal.inria.fr/hal-01215104/file/dmAO0139.pdf |