Finite groups with the minimal generating set exchange property
Abstract
Let d(G) be the smallest cardinality of a generating set of a finite group G. We give a complete classification of the finite groups with the property that, whenever x1, …, xd(G) = y1, …, yd(G) = G, for any 1 ≤ i ≤ d(G) there exists 1 ≤ j ≤ d(G) such that x1, …, xi-1, yj, xi+1, …, xd(G) = G. We also prove that for every finite group G and every maximal subgroup M of G, there exists a generating set for G of minimal size in which at least d(G)-2 elements belong to M. We conjecture that the stronger statement holds, that there exists a generating set of size d(G) in which only one element does not belong to M, and we prove this conjecture for some suitable choices of M.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.