On generating a finite group by nilpotent subgroups
The paper was motivated by a question that \textit{L. Babai} [Can. Math. Bull. 17, 467-470 (1974; Zbl 0311.05120)] had asked. It is shown that, for every positive integer \(n\), there exists a finite soluble group \(G_ n\) which can be generated by \(n\) but not fewer than \(n\) of its nilpotent subgroups. Groups satisfying this condition are constructed inductively. Given their important result, the authors then raise the problem to determine, for each positive integer \(N\), the smallest positive integer \(\nu(N)\) such that all groups of order \(N\) can be generated by at most \(\nu (N)\) of their nilpotent subgroups. The construction of the paper also provides the result that \(\nu (N)\) is less than or equal to the number of distinct prime divisors of \(N\).
- The congruence subgroup problem for finitely generated nilpotent groups
- Impartial achievement games for generating nilpotent groups
- Generation of finite groups by nilpotent subgroups.
- scientific article; zbMATH DE number 796960 (Why is no real title available?)
- Generating finite groups with conjugates of a subgroup. II
- Minimal generating sequences of \(\mathfrak{F}\)-subgroups
- Finite groups can be generated by a \(\pi\)-subgroup and a \(\pi^\prime\)-subgroup
This page was built for publication: On generating a finite group by nilpotent subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346188)