Generating wreath products (Q1337798)

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.