ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a transitive permutation group. It is semiprimitive if each of its normal subgroups is either transitive or semiregular, and it is graph-restrictive if there exists a constant c(L)c(L) such that, for every connected locally-LL pair (Γ,G)(\Gamma,G) and every arc (u,v)(u,v) of Γ\Gamma, one has ∣Guv∣≤c(L)|G_{uv}|\leq c(L). Semiprimitivity characterization conjecture. A permutation group is graph-restrictive if and only if it is semiprimitive. The conjecture seeks a characterization of graph-restrictive groups and, in the source, is motivated by results extending methods for primitive groups to semiprimitive groups; its resolution is not stated there.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.