Answers are grounded in this paper and cite their sources.
We present a dichotomy for structures A that are preserved by primitive actions of S_ω = Sym( N): such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is NP-complete, or the constraint satisfaction problem for A is in P. To prove our result, we study the first-order reducts of the Johnson graph $J(k)$, for k ≥ 2, whose automorphism group G equals the action of Sym( N) on the set V of k-element subsets of N. We use the fact that $J(k)$ has a finitely bounded homogeneous Ramsey expansion and that G is a maximal closed subgroup of Sym(V).
No takes yet. Share an insight, caveat, or question.
Bodirsky et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: