Papers › Universal Covers of Finite Groups
Universal Covers of Finite Groups
Heiko Dietrich, Alexander Hulpke
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Motivated by quotient algorithms, such as the well-known p-quotient or solvable quotient algorithms, we describe how to compute extensions H̃ of a finite group H by a direct sum of isomorphic simple ℤₚ H-modules such that H and H̃ 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 G→H and simple ℤₚ 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections