ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A1\mathfrak{A}_1 and A2\mathfrak{A}_2 be countably infinite ω\omega-categorical structures without algebraicity, not preserved by all permutations, and with the cross prevention property. A binary injective polymorphism is a binary operation preserving all relations of a structure and injective as a function; a constant polymorphism is a constant operation preserving all relations. The constraint satisfaction problem of a structure A\mathfrak{A} is denoted by CSP(A)\mathrm{CSP}(\mathfrak{A}), and Th⁡(A)\operatorname{Th}(\mathfrak{A}) denotes its theory.

Tractable-or-NP-hard dichotomy conjecture. If either

  • CSP(Ai)\mathrm{CSP}(\mathfrak{A}_i) is in P and Ai\mathfrak{A}_i has a binary injective polymorphism for both i=1i=1 and i=2i=2, or
  • Ai\mathfrak{A}_i has a constant polymorphism for both i=1i=1 and i=2i=2,

then

CSP(Th⁡(A1)∪Th⁡(A2))\mathrm{CSP}(\operatorname{Th}(\mathfrak{A}_1)\cup\operatorname{Th}(\mathfrak{A}_2))

is in P. Otherwise,

CSP(Th⁡(A1)∪Th⁡(A2))\mathrm{CSP}(\operatorname{Th}(\mathfrak{A}_1)\cup\operatorname{Th}(\mathfrak{A}_2))

is NP-hard.

The conjecture would extend the paper's tractability and hardness results to combinations of broad classes of countably infinite ω\omega-categorical structures with cross prevention. It remains open in general.

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.