Timeline for Program for computing group cohomology
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 15, 2019 at 7:05 | history | suggested | Olexandr Konovalov |
Updated tags
|
|
| Sep 14, 2019 at 23:54 | review | Suggested edits | |||
| S Sep 15, 2019 at 7:05 | |||||
| Apr 4, 2012 at 8:06 | history | edited | Yemon Choi |
added cohomology tag
|
|
| Apr 4, 2012 at 8:03 | answer | added | Graham Ellis | timeline score: 18 | |
| Mar 29, 2012 at 21:51 | answer | added | Ronnie Brown | timeline score: 4 | |
| Mar 29, 2012 at 16:06 | history | edited | Max Horn |
Added computer-algebra tag
|
|
| Mar 29, 2012 at 16:04 | comment | added | Max Horn | Actually, the answer is only "no" if one asks whether such a program exists that works for every group. But for many clases of (interesting) groups, it is indeed possible go compute cohomology beyond $H^1$. For example, for (even infinite) polycyclic groups (as implemented in GAP and the GAP package polycyclic). So, if you are interested in specific groups, then telling us more about these groups might lead to some less "negative" answers ;-) | |
| Mar 29, 2012 at 15:30 | answer | added | Andy Putman | timeline score: 13 | |
| Mar 29, 2012 at 15:29 | answer | added | Igor Rivin | timeline score: 4 | |
| Mar 29, 2012 at 15:14 | comment | added | :( any nonnegative answer would have made me happy | ||
| Mar 29, 2012 at 14:53 | comment | added | Steve D | The answer is "no". | |
| Mar 29, 2012 at 14:33 | comment | added | Will Sawin | With a presentation for the group and the matrices corresponding to the generators, or with some other description? | |
| Mar 29, 2012 at 13:33 | history | asked | CC BY-SA 3.0 |