Geodesic
Cyclic sieving phenomenon in non-crossing connected graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2011_special_260_a36,
     author = {Guo, Alan},
     title = {Cyclic sieving phenomenon in non-crossing connected graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)},
     year = {2011},
     doi = {10.46298/dmtcs.2923},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2923/}
}
TY  - JOUR
AU  - Guo, Alan
TI  - Cyclic sieving phenomenon in non-crossing connected graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2923/
DO  - 10.46298/dmtcs.2923
LA  - en
ID  - DMTCS_2011_special_260_a36
ER  - 
%0 Journal Article
%A Guo, Alan
%T Cyclic sieving phenomenon in non-crossing connected graphs
%J Discrete mathematics & theoretical computer science
%D 2011
%V DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2923/
%R 10.46298/dmtcs.2923
%G en
%F DMTCS_2011_special_260_a36
Guo, Alan. Cyclic sieving phenomenon in non-crossing connected graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) (2011). doi : 10.46298/dmtcs.2923. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2923/

Cité par Sources :