The extremal solvabilizer conjecture for finite groups
The extremal solvabilizer conjecture for finite groups
Let be a finite group, and define
A composition factor of is a factor in a composition series of .
Extremal solvabilizer conjecture. If
then has a composition factor isomorphic to .
The preceding theorem establishes the lower bound for every nonsolvable finite group. Thus the conjecture concerns the equality case and asserts that the smallest possible nonsolvable value is explained by the occurrence of as a composition factor.
Sources & referencesView supporting material
Primary source
Banafsheh Akbari, Ethan Han, Sasha Lin and Benjamin Vakil, “The Number of Solvabilizers in Finite Groups”, arXiv:2511.11544 (2025).
Additional references
2 papers in this index state this conjecture (2024–2025). The statement above is taken from the most recent of them; the others are arXiv:2403.08129.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.