ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite permutation group. Call GG semiprimitive if every normal subgroup of GG is transitive or semiregular, and call GG graph-restrictive if there is a constant c(G)c(G) such that, for every locally GG pair (Γ,H)(\Gamma,H), the order of a vertex stabiliser in HH is at most c(G)c(G). Potočnik–Spiga–Verret's conjecture.

G is semiprimitive if and only if G is graph-restrictive.G\text{ is semiprimitive if and only if }G\text{ is graph-restrictive}.

This is the graph-theoretic problem motivating the paper and is described there as potentially the most intractable problem in the section; the forward implication remains open.

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.