(1) Department of Mathematics [Durham]
Cyclic sieving phenomenon in non-crossing connected graphs
(1) Department of Mathematics [Durham]
English
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.
French
Un graphe connexe dont les sommets sont disposés sur un cercle est sans croisement si ses arêtes ne se croisent pas. Nous démontrons une conjecture de S.-P. Eu affirmant que la fonction génératrice q-binomiale dénombrant de tels graphes exhibe le phénomène du crible cyclique.
- [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
- [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
- cyclic sieving phenomenon
- non-crossing connected graphs
- Lagrange inversion
Source: OpenCitations
Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux
Discrete Mathematics
Authors : Max Bennett, Blake Madill, Anna Stokke 
Journal reference : Volume 319, 2013, pp. 62-67
DOI : 10.1016/j.disc.2013.11.024Decomposition and Merging Algorithms for Noncrossing Forests
Graphs and Combinatorics
Authors : Sabrina X. M. Pang, Lun Lv, Xiaoming Deng
Journal reference : Volume 38, 2021, pp.
DOI : 10.1007/s00373-021-02415-5
