Cyclic sieving phenomenon in non-crossing connected graphs

Details Cyclic sieving phenomenon in non-crossing connected graphs Cyclic sieving phenomenon in non-crossing connected graphs

2010-07-26

arxiv.org/abs/1007.4584v1

Mathematics

Combinatorics

13 pages, 5 figures

Scientific paper

We prove an instance of the cyclic sieving phenomenon in non-crossing
connected graphs, as conjectured by S.-P. Eu.

Affiliated with

Also associated with

No associations

Rating

Cyclic sieving phenomenon in non-crossing connected graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cyclic sieving phenomenon in non-crossing connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclic sieving phenomenon in non-crossing connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320091