Invariable generation with elements of coprime prime-power orders. (Q479775)

A finite group \(G\) is said to be invariably generated by a set \(\{g_1,\ldots,g_k\}\) if \(G=\langle g_1',\ldots,g_k'\rangle\) whenever \(g_i'\) is conjugate to \(g_i\) in \(G\). The concept arose originally in a computational problem in Galois theory [see \textit{J. D. Dixon}, Discrete Math. 105, No. 1-3, 25-39 (1992; Zbl 0756.60010)]. Let \(d_I(G)\) denote the size of the smallest set which invariably generates \(G\). The authors of the present paper are interested in the case where the elements \(g_i\) can be chosen so that their orders are relatively prime; in such a case \(G\) is called coprimely invariably generated (CIG). If it is also possible to choose the \(g_i\) so that their orders are prime-powers, then \(G\) is called prime-power coprimely invariably generated (PCIG). The following results are proved. All simple groups are PCIG. A solvable CIG group is necessarily PCIG, but this is not always true for nonsolvable groups. More generally, suppose that \(G\) is solvable and let \(A\) run over a set of representatives for the irreducible \(G\)-groups that are \(G\)-isomorphic to a complemented chief factor of \(G\). For each such \(A\) let \(\delta_G(A)\) denote the number of complemented factors \(G\)-isomorphic to \(A\) in a chief series for \(G\). Then \[ d_I(G)\leq\sum\left\lceil\frac{\delta_G(A)}{\dim_{\mathrm{End}_G(A)}A}\right\rceil. \] This strengthens a theorem of \textit{W. M. Kantor} et al. [J. Algebra 348, No. 1, 302-314 (2011; Zbl 1248.20036)] where it is shown that, when \(G\) is solvable, \(d_I(G)\) is bounded by the length of a chief series for \(G\).