Universal covers of finite groups

From MaRDI portal



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 mathbbZpH-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 mathbbZpH-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.


There are three well-established ways to describe a group for a computer: permutations, matrices, and presentations. Finite presentations are often a natural way to define groups. For groups given in this form, effective algorithms exist for special kinds of presentations, in general, however, due to the undecidability of the word problem for groups, many problems have been shown to be algorithmically undecidable. What one can do, based on von Dyck's theorem, is to attempt to investigate such a group via its quotients: this is the idea of so-called quotient algorithms. In the article under review, the authors describe how to compute finite extensions \(\widetilde{H}\) of a finite group \(H\) by a direct sum of isomorphic simple \(\mathbb{Z}_{p}H\)-modules such that \(H\) and \(\widetilde{H}\) have the same number of generators. Similar to other quotient algorithms, their description will be via a suitable covering group of \(H\). Defining this covering group requires a study of the representation module, as introduced by \textit{W. Gaschütz} [Math. Nachr. 14, 249--252 (1955; Zbl 0071.25202)]. An important application of the results obtained in this paper is that they can be used to compute, for a given epimorphism \(G \rightarrow H\) 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\). The authors also provide a description of how to compute second cohomology groups for the group \(H\), assuming a confluent rewriting system for \(H\).



Cites work



Describes a project that uses

Uses Software






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)