Timeline for counting number of circulant subsequences
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2020 at 5:56 | vote | accept | Jeff | ||
| Apr 23, 2020 at 3:36 | |||||
| Apr 19, 2020 at 20:24 | comment | added | Jeff | Thanks Kodlu! Your idea of using Polya's Enumeration Theorem sounds like a right track. However, I still didn't see how it applies to my problem. PET can count the number of colorings up to rotation and/or reflection. In my problem, we are counting the number of colorings subject to the constraints f(x)=l, and such constraint seems not equivalent to either rotation or reflection. It is clear that if x is a rotation or reflection of y then f(x)=f(y), but not vice versa. PET still sounds promising and it is just unclear how to view the set {x: f(x)=l} as an equivalent class. Sorry if I miss sth. | |
| Apr 19, 2020 at 9:32 | history | edited | kodlu | CC BY-SA 4.0 |
added 103 characters in body
|
| Apr 19, 2020 at 4:12 | history | answered | kodlu | CC BY-SA 4.0 |