Towards a soluble quotient algorithm
Journal of Symbolic Computation
Computing in permutation and matrix groups III: Sylow subgroups
Journal of Symbolic Computation
Constructing the vertex-transitive graphs of order 24
Journal of Symbolic Computation
Constructing the vertex-transitive graphs on 24 vertices
ACM SIGSAM Bulletin
Computing sylow subgroups of permutation groups using homomorphic images of centralizers
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Computer algebra handbook
Hi-index | 0.00 |
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 =@?K@?, 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).