The minimal number of generators \(d(W)\) of the restricted standard wreath product \(W = H \text{ wr }G\) of two finite soluble groups \(H\) and \(G\) is studied. The main result is: \(d(H \text{ wr }G) =\max(d((H/H')\text{wr }G),[(d(H)-2)/| G|]+ 2)\). This reduces the problem to the case \(H\) abelian, which is also discussed in detail: when \(H\) is abelian and \(d(H\text{ wr } G)\) can be computed as a function of the minimal number of generators of the Sylow subgroups of \(H\) and the structure of the chief factors of \(G\). Finally some applications are described; for example the minimal number of generators for the wreath product of two dihedral groups is computed.
- Two results on wreath products
- Generating wreath products and their augmentation ideals
- Generating numbers for wreath products
- Irreducible bases and subgroups of a wreath product in applying to diffeomorphism groups acting on the Möbius band
- Invariable generation of iterated wreath products of cyclic groups
- On the probability of generating prosoluble groups.
- Lifting wreath product extensions
- Characterization of finitely generated infinitely iterated wreath products.
- The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups
- scientific article; zbMATH DE number 4105215 (Why is no real title available?)
- Minimal generating sets of maximal size in finite monolithic groups.
- scientific article; zbMATH DE number 17080 (Why is no real title available?)
- Free wreath products with amalgamation
- On the number of generators of finite images of free products of finite groups
This page was built for publication: Generating wreath products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337798)
