The pp-construction conjecture for hard finite-domain PCSPs over homogeneous reducts
Statement
Let and be finite graphs, and let be a countably infinite graph that is a reduct of a finitely bounded homogeneous structure. Suppose that
A primitive-positive, or pp, construction interprets one relational structure in another using primitive-positive formulas.
Pp-construction conjecture. If is NP-hard, then has a pp-construction in .
This proposes a structural explanation for NP-hardness in the indicated sandwich setting. The paper explicitly leaves the assertion as an open problem; it also notes that, if P differs from NP, the preceding tractability conjecture would imply it.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.