In 1976, Wiegold asked if every finitely generated perfect group has weight 1. We introduce a new property of groups, finitely annihilated, and show that this might be a possible approach to resolving Wiegold’s problem. For finitely generated groups, we show that in several classes (finite, solvable, free), being finitely annihilated is equivalent to having noncyclic abelianisation. However, we also construct an infinite family of (finitely presented) finitely annihilated groups with cyclic abelianisation. We apply our work to show that the weight of a nonperfect finite group, or a nonperfect finitely generated solvable group, is the same as the weight of its abelianisation. This recovers the known partial results on the Wiegold problem: a finite (or finitely generated solvable) perfect group has weight 1.

Let $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}G$ be a finite group of order $n$, and let $\text {C}_n$ be the cyclic group of order $n$. For $g\in G$, let ${\mathrm{o}}(g)$ denote the order of $g$. Let $\phi $ denote the Euler totient function. We show that $\sum _{g \in \text {C}_n} \phi ({\mathrm{o}}(g))\geq \sum _{g \in G} \phi ({\mathrm{o}}(g))$, with equality if and only if $G$ is isomorphic to $\text {C}_n$. As an application, we show that among all finite groups of a given order, the cyclic group of that order has the maximum number of bidirectional edges in its directed power graph.

We present several conjectures which would describe the Nielsen equivalence classes of generating pairs for the groups SL(2,q) and PSL(2,q). The Higman invariant, which is the union of the conjugacy classes of the commutator of a generating pair and its inverse, and the trace of the commutator play key roles. Combining known results with additional work, we clarify the relationships between the conjectures, and obtain various partial results concerning them. Motivated by the work of Macbeath (A. M. Macbeath, Generators of the linear fractional groups, in Number theory (Proc. Sympos. Pure Math., vol. XII, Houston, TX, 1967) (American Mathematical Society, Providence, RI, 1969), 14–32), we use another invariant defined using traces to develop algorithms that enable us to verify the conjectures computationally for all q up to 101, and to prove the conjectures for a highly restricted but possibly infinite set of q.

In a soluble group G, if the metabelian subgroups have finite (or polycyclic, or Černikov) quotients by their centres, then so too does G.