
TL;DR
This paper proves a conjecture by Wiegold, establishing a relationship between the size of the derived subgroup of a finite p-group and the minimum breadth of its generators.
Contribution
It confirms Wiegold's conjecture by showing that large derived subgroup size implies the existence of generators with high breadth in finite p-groups.
Findings
If |G'| > p^{n(n-1)/2}, then G can be generated by elements with breadth at least n.
The proof links the size of the derived subgroup to the breadth of generators.
Provides a new criterion for generating finite p-groups based on subgroup size.
Abstract
In this short note we confirm a conjecture of James Wiegold. We prove that if is a finite -group and for some non-negative integer , then the group can be generated by the elements of breadth at least . The breadth of an element of a finite -group is defined by the equation , where is the centralizer of in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
