English

Structures preserved by primitive actions of $S_\omega$

Logic 2025-08-15 v3 Computational Complexity

Abstract

We present a dichotomy for structures AA that are preserved by primitive actions of Sω=Sym(N)S_{\omega} = \text{Sym}({\mathbb N}): such a structure primitively positively constructs all finite structures and the constraint satisfaction problem is NP-complete, or the constraint satisfaction problem for AA is in P. To prove our result, we study the first-order reducts of the Johnson graph J(k)J(k), for k2k \geq 2, whose automorphism group GG equals the action of Sym(N)\text{Sym}({\mathbb N}) on the set VV of kk-element subsets of N\mathbb N. We use the fact that J(k)J(k) has a finitely bounded homogeneous Ramsey expansion and that GG is a maximal closed subgroup of Sym(V)\text{Sym}(V).

Keywords

Cite

@article{arxiv.2501.03789,
  title  = {Structures preserved by primitive actions of $S_\omega$},
  author = {Manuel Bodirsky and Bertalan Bodor},
  journal= {arXiv preprint arXiv:2501.03789},
  year   = {2025}
}

Comments

27 pages plus references, submitted to LMCS