A computer program for the calculation of a covering group of a finite group

DOI10.1016/0022-4049(85)90046-5zbMATH Open0552.20006OpenAlexW2014270052MaRDI QIDQ801032FDOQ801032

Derek F. Holt

Publication date: 1985

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-4049(85)90046-5

zbMATH Keywords

relationspresentationcohomology groupsmultiplierpermutation groupcovering groupcorestrictionp-Sylow subgroupNQ-algorithm

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04) Projective representations and multipliers (20C25)

Cites Work

• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Computing in permutation and matrix groups. III: Sylow subgroups
• The mechanical computation of first and second cohomology groups
• Computing Sylow subgroups of permutation groups using homomorphic images of centralizers
• The Fischer-Clifford matrices of a maximal subgroup of 𝐹𝑖′₂₄
• Representing Subgroups of Finitely Presented Groups by Quotient Subgroups

This page was built for publication: A computer program for the calculation of a covering group of a finite group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801032)