Mousavi's odd-prime solubilizer conjecture

Let GG be a finite insoluble group, let xGx\in G, and write SolG(x)\operatorname{Sol}_G(x) for the set of elements yGy\in G such that x,y\langle x,y\rangle is soluble. Mousavi's odd-prime solubilizer conjecture. For every odd prime pp and every positive integer nn,

SolG(x)pn.|\operatorname{Sol}_G(x)|\neq p^n.

The assertion generalizes the corresponding observation for minimal simple groups reported in the paper, but the source supplies no proof for arbitrary finite insoluble groups.

Sources & referencesView supporting material

Primary source

Banafsheh Akbari, Jake Chuharski, Vismay Sharan and Zachary Slonim, “Characterization of Solubilizers of Elements in Minimal Simple Groups”, arXiv:2309.09104 (2024).

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.