Cyclic sieving for two families of non-crossing graphs
We prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2011-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2953/pdf |
| _version_ | 1827324031049662464 |
|---|---|
| author | Svetlana Poznanović |
| author_facet | Svetlana Poznanović |
| author_sort | Svetlana Poznanović |
| collection | DOAJ |
| description | We prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo. |
| first_indexed | 2024-04-25T02:03:23Z |
| format | Article |
| id | doaj.art-d6f3d8d988ed4d31818c4ab601cd626a |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:03:23Z |
| publishDate | 2011-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-d6f3d8d988ed4d31818c4ab601cd626a2024-03-07T14:49:33ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502011-01-01DMTCS Proceedings vol. AO,...Proceedings10.46298/dmtcs.29532953Cyclic sieving for two families of non-crossing graphsSvetlana Poznanović0School of Mathematics - Georgia Institute of TechnologyWe prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo.https://dmtcs.episciences.org/2953/pdfcyclic sievingnon-crossing forestsnon-crossing graphs[math.math-co] mathematics [math]/combinatorics [math.co][info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Svetlana Poznanović Cyclic sieving for two families of non-crossing graphs Discrete Mathematics & Theoretical Computer Science cyclic sieving non-crossing forests non-crossing graphs [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Cyclic sieving for two families of non-crossing graphs |
| title_full | Cyclic sieving for two families of non-crossing graphs |
| title_fullStr | Cyclic sieving for two families of non-crossing graphs |
| title_full_unstemmed | Cyclic sieving for two families of non-crossing graphs |
| title_short | Cyclic sieving for two families of non-crossing graphs |
| title_sort | cyclic sieving for two families of non crossing graphs |
| topic | cyclic sieving non-crossing forests non-crossing graphs [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/2953/pdf |
| work_keys_str_mv | AT svetlanapoznanovic cyclicsievingfortwofamiliesofnoncrossinggraphs |