The Mechanical Computation of First and Second Cohomology Groups
暂无分享,去创建一个
We describe the theory and implementation of computer algorithms designed to compute the dimensions of the first and second cohomology groups of a finite group G, acting on a finite module M defined over a field K of prime order. Presentations of extensions of M by G can also be computed. The method is to find a Sylow p-subgroup P of G, where p [email protected][email protected]?, to compute H^x (P, M) first, using variants of the Nilpotent Quotient Algorithm, and then to compute H^x (G, M) as the subgroup of stable elements of H^x (P, M).
[1] Saunders MacLane,et al. Cohomology Theory in Abstract Groups. III , 1947 .
[2] J. Leon. On an algorithm for finding a base and a strong generating set for a group given by generating permutations , 1980 .
[3] Derek F. Holt,et al. A computer program for the calculation of a covering group of a finite group , 1985 .
[4] Wolfgang Gaschütz,et al. Über modulare Darstellungen endlicher Gruppen, die von freien Gruppen induziert werden , 1954 .