Abstract
We say that a finite group G satisfies the independence property if, for every pair of distinct elements x and y of G, either {x, y} is contained in a minimal generating set for G or one of x and y is a power of the other. We give a complete classification of the finite groups with this property, and in particular prove that every such group is supersoluble. A key ingredient of our proof is a theorem showing that all but three finite almost simple groups H contain an element s such that the maximal subgroups of H containing s, but not containing the socle of H, are pairwise non-conjugate.
| Original language | English |
|---|---|
| Pages (from-to) | 509-545 |
| Number of pages | 37 |
| Journal | International Journal of Algebra and Computation |
| Volume | 33 |
| Issue number | 3 |
| Early online date | 29 Apr 2023 |
| DOIs | |
| Publication status | Published - 1 May 2023 |
Keywords
- Generating sets
- Supersoluble groups
- Simple groups
Fingerprint
Dive into the research topics of 'Finite groups satisfying the independence property'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver