Cyclic sieving phenomenon in non-crossing connected graphs.
The Electronic Journal of Combinatorics [electronic only] (2011)
- Volume: 18, Issue: 1, page Research Paper P9, 14 p., electronic only-Research Paper P9, 14 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topGuo, Alan. "Cyclic sieving phenomenon in non-crossing connected graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P9, 14 p., electronic only-Research Paper P9, 14 p., electronic only. <http://eudml.org/doc/227183>.
@article{Guo2011,
author = {Guo, Alan},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {non-crossing graph; q-binomial generating function},
language = {eng},
number = {1},
pages = {Research Paper P9, 14 p., electronic only-Research Paper P9, 14 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Cyclic sieving phenomenon in non-crossing connected graphs.},
url = {http://eudml.org/doc/227183},
volume = {18},
year = {2011},
}
TY - JOUR
AU - Guo, Alan
TI - Cyclic sieving phenomenon in non-crossing connected graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P9, 14 p., electronic only
EP - Research Paper P9, 14 p., electronic only
LA - eng
KW - non-crossing graph; q-binomial generating function
UR - http://eudml.org/doc/227183
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.