HIGHLIGHTS
- who: DMTCS proc. AO et al. from the School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA have published the research: Cyclic sieving for two families of non-crossing graphs, in the Journal: (JOURNAL)
- what: More precisely the cyclic group acts on these graphs naturally by rotation and the authors show that the orbit structure of this action is encoded by certain polynomials.
SUMMARY
A non-crossing graph of size n is a graph with vertex set {1, 2,.., n} arranged in a circle whose edges are straight line segments . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.