ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A=⟨A;R⟩\mathbb{A}=\langle A;\mathscr{R}\rangle be a finite core relational structure of finite relational signature. A polymorphism of A\mathbb{A} is an operation that is a homomorphism from a direct power of A\mathbb{A} to A\mathbb{A}. A weak near unanimity operation (WNU) is an idempotent operation satisfying

w(y,x,…,x)=w(x,y,x,…,x)=⋯=w(x,…,x,y)w(y,x,\dots,x)=w(x,y,x,\dots,x)=\dots=w(x,\dots,x,y)

for all x,yx,y. The constraint satisfaction problem CSP⁡(A)\operatorname{CSP}(\mathbb{A}) asks whether a finite relational structure has a homomorphism to A\mathbb{A}. The bounded width dichotomy conjecture. If A\mathbb{A} has a WNU polymorphism, then CSP⁡(A)\operatorname{CSP}(\mathbb{A}) is tractable. If A\mathbb{A} has no WNU polymorphism, then CSP⁡(A)\operatorname{CSP}(\mathbb{A}) is NP\texttt{NP}-complete. This conjecture refines the Feder–Vardi dichotomy conjecture and proposes that the presence of a WNU polymorphism exactly characterizes tractable finite-core constraint satisfaction problems. The source does not state a resolution, so its status is recorded as open.

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.