DOAJ Open Access 2011

Cyclic sieving phenomenon in non-crossing connected graphs

Alan Guo

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (1)

Alan Guo

Format Sitasi

APA MLA BibTeX

Guo, A. (2011). Cyclic sieving phenomenon in non-crossing connected graphs. https://doi.org/10.46298/dmtcs.2923

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2923

Informasi Jurnal

Tahun Terbit: 2011
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2923
Akses: Open Access ✓