|
⇤ ← Revision 1 as of 2009-01-12 16:43:05
Size: 1048
Comment:
|
Size: 1048
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 8: | Line 8: |
| The computation of cohomology rings turns out to be very challenging. The first complete cohomology computation for the 267 groups of order 64 by J. F. Carlson took two years with interruptions, mainly due to difficulties in Groebner basis computations. The computation for the 2328 groups of order 128 seemed to be a long way out of reach. <<BR>> | The computation of cohomology rings turns out to be very challenging. The first complete cohomology computation for the 267 groups of order 64 by J. F. Carlson took two years with interruptions, mainly due to difficulties in Gröbner basis computations. The computation for the 2328 groups of order 128 seemed to be a long way out of reach. <<BR>> |
Sage Days 12: San Diego
Titles and abstracts
Simon King (Schiller-Universität Jena): The cohomology of finite p-groups
Abstract:
The cohomology of finite p-groups with coefficients in GF(p) is a subject that links parts of group theory, algebraic topology, and modular representation theory.
The computation of cohomology rings turns out to be very challenging. The first complete cohomology computation for the 267 groups of order 64 by J. F. Carlson took two years with interruptions, mainly due to difficulties in Gröbner basis computations. The computation for the 2328 groups of order 128 seemed to be a long way out of reach.
We achieved a major progress by implementing algorithms of D. J. Green and D. Benson in Sage, based on earlier C-programs of D. J. Green. With our programs, we were able to compute the cohomology of the groups of order 128 in about 10 months CPU time. Also, we computed all but 10 cohomology rings of 3-, 5-, and 7-groups up to order 625.