• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Derek Holt
  • (University of Warwick, UK)
  • The Computation of Cohomology Groups - Part 2
  • 3pm–4pm, Thursday 14th November, 2002
  • Carlaw 535
  • Let G = < X | R > be a finitely presented group acting on a KG-module M, with |X| = r, |R| = s, dim(M) = n. In the first talk, we showed how the first cohomology group H1(G,M) could be computed as

    Nullspace(C1) / Rowspace(C0),
    for a certain n×nr matrix C0 and nr×ns matrix C1 over K.

    In this talk, we discuss the computation of H2(G,M). This is another important object to compute because the group extensions

    0→M→E→G→1
    in which the module action of G on M is induced by conjugation in E are classified up to equivalence by H2(G,M).

    Once again, the main effort of the computation occurs in the calculation of the nullspace of a certain matrix. This works out nicely when G is a pc-group, but for a general finite group we have to work harder to reduce the size of the matrix involved. If G is a permutation group, then we can sometimes make use of a base and strong generating set to reduce this size to manageable proportions. Furthermore, if we are only interested in the order of the group H2(G,M), rather than in constructing the extensions explicitly, then we can use some cohomology theory to reduce the computation from G to certain p-subgroups of G.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.