Timeline for Sum over permuted and unpermuted indices
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2018 at 8:43 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 8, 2018 at 7:57 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 6, 2018 at 7:08 | answer | added | Marius Ladegård Meyer | timeline score: 1 | |
| Feb 6, 2018 at 4:31 | comment | added | Mohammad Akhond | By itself this doesn't teach me anything. It is part of a slightly more complicated function involving another variable t. I am aware of the combinatoric nightmare here and maybe N=20 is too much to ask, but if I can even look at the expansion to first order in t for example it will be useful as the x's are expected to form characters of some representation of a Lie group, which tell me about the symmetry of the problem I am looking at. What about N=6? Is this possible? Thanks | |
| Feb 5, 2018 at 15:10 | comment | added | Marius Ladegård Meyer |
Why? What will you learn? For N = 20, the number of different permutations is larger than 2*10^18. Multiply that by 2^19 to get all the sums over the s[i] and you got yourself a waiting game.
|
|
| Feb 5, 2018 at 11:50 | review | First posts | |||
| Feb 5, 2018 at 15:35 | |||||
| Feb 5, 2018 at 11:47 | history | asked | Mohammad Akhond | CC BY-SA 3.0 |