Universal covers of finite groups
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\).
- A computer application to finite p-groups
- A finite soluble quotient algorithm
- A polycyclic quotient algorithm
- 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
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Computing with Abelian sections of finitely presented groups
- Decomposition of the Relation Modules of a Finite Group
- 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?)
- 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
- Towards a soluble quotient algorithm
- Universal covering group of \(U(n)\) and projective representations
- Computing stable epimorphisms onto finite groups
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- scientific article; zbMATH DE number 4156760 (Why is no real title available?)
- scientific article; zbMATH DE number 4083934 (Why is no real title available?)
- scientific article; zbMATH DE number 1567964 (Why is no real title available?)
- The perfect groups of order up to two million
- Computational group theory. Abstracts from the workshop held June 1--6, 2025
- Computational group theory: bedrock and new frontiers
- Computing the character table of a 2-local maximal subgroup of the Monster
- Arithmetic in group extensions
- A computer program for the calculation of a covering group of a finite group
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)