The Polycirculant Conjecture for elusive permutation groups
Let be a finite transitive permutation group. Call elusive if it contains no derangements of prime order. The -closure of on its permutation domain is the largest subgroup of the symmetric group on that domain having the same orbits on ordered pairs as ; is -closed if it equals its -closure. Polycirculant Conjecture. There are no -closed elusive groups. This is a longstanding open problem in algebraic graph theory, with various partial results known.
References
- Jiyong Chen, Melissa Lee, Dorde Mitrovic, E. A. O'Brien and Binzhou Xia, “Elusive groups from non-split extensions”, arXiv:2508.12652 (2026).
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.