The road closure conjecture for primitive basic permutation groups
Statement
Let be a primitive basic permutation group. Say that satisfies condition (c) of Theorem 4 or condition (d) of Theorem 4 when it has the respective properties listed there.
Road closure conjecture. If does not satisfy condition (c) or (d) of Theorem 4, then has the road closure property.
The road closure property is equivalent to the -id property for finite transitive permutation groups, and the surrounding results exclude transitive imprimitive and primitive non-basic groups. The claim concerns the remaining primitive basic cases, with computational tests reported elsewhere in the paper but no resolution stated here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.