Skip to Main content Skip to Navigation
Conference papers

Cyclic sieving for two families of non-crossing graphs

Abstract : We prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-01215075
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, October 13, 2015 - 3:06:15 PM
Last modification on : Wednesday, July 31, 2019 - 3:24:16 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:20:12 AM

File

dmAO0169.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01215075, version 1

Collections

Citation

Svetlana Poznanović. Cyclic sieving for two families of non-crossing graphs. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.789-800. ⟨hal-01215075⟩

Share

Metrics

Record views

133

Files downloads

675