scientific article; zbMATH DE number 17080
[For the entire collection see Zbl 0722.00008.] The aim of this paper is to contribute to the following problem. Given two finite groups \(H_ 1\) and \(H_ 2\), does there exist a finite group \(G\) containing them, and such that \(d(G)=d(H_ 1)+d(H_ 2)\), where \(d(H)\) stands for the minimal number of generators of \(H\)? A motivation for this problem lies in the theory of profinite groups. Several bounds for the number of generators of direct products and wreath products are obtained. Exact results arise in some special cases. As a sample, \(d(G\wr C_ n)=d(G)+1\) when \(G\) is finite and nilpotent.
- Generating finite soluble groups
- Generating wreath products
- Generating wreath products and their augmentation ideals
- Generating the augmentation ideal
- On the minimal number of generators of free profinite products of profinite groups
- scientific article; zbMATH DE number 4105215 (Why is no real title available?)
- Noncancellation and the number of generators
- MINIMAL NUMBER OF GENERATORS AND COMPOSITION LENGTH OF SOCLE IN FINITE GROUPS
- The Minimal Number of Cyclic Generators of the Symmetric and Alternating Groups
- On the number of generators of a finite group
- On the number of generators of a finite group
- On the number of generators of finite images of free products of finite groups
- Some questions on the number of generators of a finite group
- On the number of generators needed for free profinite products of finite groups.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973774)
