Universal covers of finite groups

DOI10.1016/J.JALGEBRA.2020.10.032MaRDI QIDQ2216564zbMATH OpenOpenAlexFDO

Authors Heiko Dietrich, A. Hulpke

Publication date 16 December 2020

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.11453

zbMATH Keywords

cohomology of groupscomputational group theoryquotient algorithms

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Computational methods for problems pertaining to group theory (20-08)

Abstract: Motivated by quotient algorithms, such as the well-known $p$-quotient or solvable quotient algorithms, we describe how to compute extensions $ildeH$ of a finite group $H$ by a direct sum of isomorphic simple $mathbb{Z}_{p}H$-modules such that $H$ and $ildeH$ have the same number of generators. Similar to other quotient algorithms, our description will be via a suitable covering group of $H$. Defining this covering group requires a study of the representation module, as introduced by Gasch"utz in 1954. Our investigation involves so-called Fox derivatives (coming from free differential calculus) and, as a by-product, we prove that these can be naturally described via a wreath product construction. An important application of our results is that they can be used to compute, for a given epimorphism $GoH$ and simple $mathbb{Z}_{p}H$-module $V$, the largest quotient of $G$ that maps onto $H$ with kernel isomorphic to a direct sum of copies of $V$. For this we also provide a description of how to compute second cohomology groups for the (not necessarily solvable) group $H$, assuming a confluent rewriting system for $H$. To represent the corresponding group extensions on the computer, we introduce a new hybrid format that combines this rewriting system with the polycyclic presentation of the module.

Recommendations

• A computer program for the calculation of a covering group of a finite group
• Towards a soluble quotient algorithm
• A finite soluble quotient algorithm
• A polycyclic quotient algorithm
• scientific article; zbMATH DE number 4134296

Cites work

• scientific article; zbMATH DE number 3889792 (Why is no real title available?)
• scientific article; zbMATH DE number 5778575 (Why is no real title available?)
• scientific article; zbMATH DE number 1187227 (Why is no real title available?)
• scientific article; zbMATH DE number 3672557 (Why is no real title available?)
• scientific article; zbMATH DE number 3736029 (Why is no real title available?)
• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 1206942 (Why is no real title available?)
• scientific article; zbMATH DE number 534859 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 194815 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• scientific article; zbMATH DE number 848088 (Why is no real title available?)
• scientific article; zbMATH DE number 923860 (Why is no real title available?)
• A computer application to finite p-groups
• A finite soluble quotient algorithm
• A polycyclic quotient algorithm
• APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
• Algorithms determining finite simple images of finitely presented groups
• Algorithms for polycyclic-by-finite groups
• An \(L_2\)-quotient algorithm for finitely presented groups on arbitrarily many generators.
• An L₂-quotient algorithm for finitely presented groups.
• An algorithm for computing homology groups
• Computing with Abelian sections of finitely presented groups
• Decomposition of the Relation Modules of a Finite Group
• Maximal Frattini extensions
• Maximal subgroups of direct products
• On complexity of multiplication in finite soluble groups.
• Representations of groups. A computational approach.
• Representing Subgroups of Finitely Presented Groups by Quotient Subgroups
• The Frattini module
• The mechanical computation of first and second cohomology groups
• Towards a soluble quotient algorithm
• Zu einem von B. H. und H. Neumann gestellten Problem
• Über modulare Darstellungen endlicher Gruppen, die von freien Gruppen induziert werden

Cited in

(9)

• Computing stable epimorphisms onto finite groups
• Universal covering group of \(U(n)\) and projective representations
• scientific article; zbMATH DE number 4083934 (Why is no real title available?)
• Towards a soluble quotient algorithm
• scientific article; zbMATH DE number 4156760 (Why is no real title available?)
• The perfect groups of order up to two million
• scientific article; zbMATH DE number 1567964 (Why is no real title available?)
• A computer program for the calculation of a covering group of a finite group
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Universal covers of finite groups

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