Timeline for cyclic polynomials and their solutions
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 27, 2012 at 9:29 | vote | accept | David Epstein | ||
Feb 24, 2012 at 0:54 | history | edited | Ben Webster♦ | CC BY-SA 3.0 |
added 316 characters in body
|
Feb 24, 2012 at 0:41 | comment | added | Ben Webster♦ | Well, you don't need infinitely many. Just vectors that span the positive cone in the subgroup $\{\mathbf{k}\cdot (1,2,\dots,N)\equiv 0\pmod{N}$. | |
Feb 24, 2012 at 0:38 | history | edited | Ben Webster♦ | CC BY-SA 3.0 |
added 12 characters in body
|
Feb 23, 2012 at 10:50 | comment | added | David Epstein | Do you mean to sum from i=1 to N in the definition of $p_h$, and the indices called h to add up to a multiple of N? This seems to give an infinite set of cyclic invariants. I was hoping that one could solve this problem with N invariants, which you say is impossible, or with not many more than N, the fewer the better. | |
Feb 22, 2012 at 14:10 | history | answered | Ben Webster♦ | CC BY-SA 3.0 |