2000 character limit reached
Structures preserved by primitive actions of
Published 7 Jan 2025 in math.LO and cs.CC | (2501.03789v2)
Abstract: We present a dichotomy for structures that are preserved by primitive actions of : either such a structure interprets all finite structures primitively positively, or it is of a very simple form and in particular has a binary polymorphism and an automorphism satisfying . It is a consequence of our results that the constraint satisfaction problem for is in P or NP-complete. 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 .
Paper Prompts
Sign up for free to create and run prompts on this paper.