Timeline for How to transform abstract finite group to permutation group?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 9:23 | history | edited | CommunityBot | Commonmark migration | |
| Oct 5, 2015 at 1:31 | history | edited | march | CC BY-SA 3.0 | added 2 characters in body |
| Oct 5, 2015 at 1:31 | comment | added | march | @vanabel: Yes absolutely, thanks for pointing that out! I'll fix it now. | |
| Oct 5, 2015 at 1:21 | comment | added | van abel | by the way, the second rule should be replaced to be ncm[c,i,d], or it may produce ncm[]. | |
| Oct 4, 2015 at 18:17 | history | edited | march | CC BY-SA 3.0 | Fixed code, added explanation. |
| Oct 4, 2015 at 5:39 | comment | added | van abel | thanks a lot, the idea to move b to right is great!! Could you please explain why we need ncm[a_]:>a to stop the loop of replacement? And what's the difference of a_, a__, and a___ in this answer? I have read the manual, but still confused when I try to use it, if possible, please explain it to me the difference, Thanks again! | |
| Oct 4, 2015 at 4:59 | vote | accept | van abel | ||
| Oct 4, 2015 at 4:59 | review | Suggested edits | |||
| Oct 4, 2015 at 7:49 | |||||
| Oct 4, 2015 at 4:46 | comment | added | ciao | Nice answer, +1 | |
| Oct 4, 2015 at 3:32 | history | answered | march | CC BY-SA 3.0 |