The extremal solvabilizer conjecture for finite groups

Let GG be a finite group, and define

Solv(G)={SolG(x):xG}.\operatorname{Solv}(G)=\{\operatorname{Sol}_G(x):x\in G\}.

A composition factor of GG is a factor in a composition series of GG.

Extremal solvabilizer conjecture. If

Solv(G)=32,|\operatorname{Solv}(G)|=32,

then GG has a composition factor isomorphic to A5A_5.

The preceding theorem establishes the lower bound Solv(G)32|\operatorname{Solv}(G)|\geq 32 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 A5A_5 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.