The solubilizer probability bound conjecture

Let GG be a finite group and xGx\in G. Define the solubilizer probability of xx by

PS(x)=SolG(x)G,P_S(x)=\frac{|\operatorname{Sol}_G(x)|}{|G|},

where SolG(x)\operatorname{Sol}_G(x) is the set of elements yGy\in G such that x,y\langle x,y\rangle is soluble. Solubilizer probability bound conjecture. If GG is insoluble, then

PS(x)35P_S(x)\leq \frac{3}{5}

for every xGx\in G; furthermore, if xx is not an involution, then

PS(x)<12.P_S(x)<\frac{1}{2}.

Computations for nonabelian simple groups of order at most 22 million found the value 3/53/5 in A5\mathrm{A}_5 and one additional value above 1/21/2, namely 5/95/9 for an involution in O(5,3)O(5,3). The general bounds remain unproved in the source.

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.