Prime-graph equality conjecture for intransitive subgroups of alternating groups

Let G=AnG=A_n and H=(Sk×Snk)GH=(S_k\times S_{n-k})\cap G, where 1<k<n1<k<n and pkp\leqslant k for every prime number pnp\leqslant n. Prime-graph equality conjecture. If n12n\geqslant 12, then

Γ(G)=Γ(H)\Gamma(G)=\Gamma(H)

if and only if nn is odd, k=n1k=n-1, and n4n-4 is composite. This concerns the unresolved classification of when an alternating group and an associated intransitive maximal subgroup have the same prime graph; the paper notes that the problem is connected with difficult additive questions about representations of integers as sums of distinct primes.

Sources & referencesView supporting material

Primary source

Timothy C. Burness and Elisa Covato, “On the prime graph of simple groups”, arXiv:1407.8128 (2014).

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.