Cherlin's almost simple binary primitive group conjecture

About 11 years old · traced to

Let GG be an almost simple primitive permutation group acting on a set Ω\Omega, and suppose that its permutation action is binary. Cherlin's almost simple conjecture. Then

G=Sym⁡(Ω).G=\operatorname{Sym}(\Omega).

This statement is presented as sufficient for proving Cherlin's classification conjecture and is reduced from the original conjecture using work of Cherlin and Wiscons. The supplied context does not establish whether this almost simple statement is proved in full, so its status is recorded as open.

References

Primary source

Nick Gill, Francesca Dalla Volta and Pablo Spiga, “Cherlin's conjecture for sporadic simple groups”, arXiv:1705.05150 (2018).

Additional references

3 papers in this index state this conjecture (2015–2017). The statement above is taken from the most recent of them; the others are arXiv:1610.01792, arXiv:1506.04187.

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.