ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers 2≤k<l2\leq k<l, let LOk\mathbf{LO}_k and LOl\mathbf{LO}_l denote the corresponding symmetric relational templates, and let PCSP(LOk,LOl)\mathrm{PCSP}(\mathbf{LO}_k,\mathbf{LO}_l) be the promise problem whose instances homomorphically map to LOk\mathbf{LO}_k and whose outputs must homomorphically map to LOl\mathbf{LO}_l. LO\mathbf{LO}-template hardness conjecture. For every 2≤k<l2\leq k<l, PCSP(LOk,LOl)\mathrm{PCSP}(\mathbf{LO}_k,\mathbf{LO}_l) is NP-hard. The paper has classified the relevant three-element cases except for LO3\mathbf{LO}_3; the smallest case PCSP(LO2,LO3)\mathrm{PCSP}(\mathbf{LO}_2,\mathbf{LO}_3) is therefore among the unresolved instances motivating the conjecture.

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.