加载中…
We present a dichotomy for structures that are preserved by primitive actions of : such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is NP-complete, or the constraint satisfaction problem for is in P. To prove our result, we study the first-order reducts of the Johnson graph , for , whose automorphism group equals the action of on the set of -element subsets of . We use the fact that has a finitely bounded homogeneous Ramsey expansion and that is a maximal closed subgroup of .

生成讲解博客的中文版本

生成AI智能校验的中文版本