Cyclic sieving phenomenon in non-crossing connected graphs
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽
Keyword(s):
International audience 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. 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.
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽
Keyword(s):
Keyword(s):
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽
2008 ◽
Vol DMTCS Proceedings vol. AJ,...
(Proceedings)
◽
Keyword(s):
2007 ◽
Vol Vol. 9 no. 1
(Graph and Algorithms)
◽
2020 ◽
Vol DMTCS Proceedings, 28th...
◽