Timeline for Is there an algorithm for computing Schur multiplier?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2011 at 15:44 | comment | added | Josh | There are some partial results in intlpress.com/hha/v12/n1/a3. If G is finitely presented, and you're okay with field coefficients, there is an algorithm that can give an upper bound to H_2. | |
| Aug 18, 2011 at 14:36 | comment | added | Al Tal | @Franz: The question mentioned by you is about finite groups, and I am mostly interested in infinite groups. As I understand, the function AbelianInvariantsMultiplier from GAP works only for finite groups. Also it should be mentioned that question is about "theoretical" algorithm (with any space and time constraints), but it should work for any group presentation. | |
| Aug 18, 2011 at 14:30 | answer | added | Gjergji Zaimi | timeline score: 15 | |
| Aug 18, 2011 at 14:18 | comment | added | Igor Rivin | @Franz: "implemented" does not necessary mean that there is an algorithm :) | |
| Aug 18, 2011 at 14:08 | comment | added | Franz Lemmermeyer | This is implemented in GAP and thus probably accessible via sage. See the first answer to mathoverflow.net/questions/53730/… for some code. | |
| Aug 18, 2011 at 14:04 | history | asked | Al Tal | CC BY-SA 3.0 |