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

  • 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.

https://doi.org/10.46298/dmtcs.2923
Source: HAL:hal-01215104v1
Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: non-crossing connected graphs,Lagrange inversion,cyclic sieving phenomenon,[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
    Source : OpenAIRE Graph
  • Reflection Group Combinatorics; Funder: National Science Foundation; Code: 1001933

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0012-365x(98)00372-0
  • 10.1016/s0012-365x(98)00372-0
Analytic combinatorics of non-crossing configurations

Share and export

Consultation statistics

This page has been seen 154 times.
This article's PDF has been downloaded 151 times.