Cyclic sieving phenomenon in non-crossing connected graphs
Alan Guo
TL;DR
This paper proves a specific case of the cyclic sieving phenomenon in non-crossing connected graphs, confirming a conjecture by S.-P. Eu and advancing understanding of symmetry properties in combinatorial structures.
Contribution
It establishes the cyclic sieving phenomenon for non-crossing connected graphs, providing a rigorous proof of a conjecture in this area.
Findings
Confirmed the cyclic sieving phenomenon in non-crossing connected graphs
Provided a proof of Eu's conjecture on this topic
Enhanced understanding of symmetry in combinatorial graph structures
Abstract
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Computational Geometry and Mesh Generation