Small PCSPs that reduce to large CSPs

09/16/2021
by   Alexandr Kazda, et al.
0

For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B. We are promised that the input satisfies exactly one of these two cases. If there exists a structure C with homomorphisms A→ C→ B, then PCSP(A,B) reduces naturally to CSP(C). To the best of our knowledge all known tractable PCSPs reduce to tractable CSPs in this way. However Barto showed that some PCSPs over finite structures A, B require solving CSPs over infinite C. We show that even when such a reduction to finite C is possible, this structure may become arbitrarily large. For every integer n>1 and every prime p we give A, B of size n with a single relation of arity n^p such that PCSP(A, B) reduces via a chain of homomorphisms A→ C→ B to a tractable CSP over some C of size p but not over any smaller structure. In a second family of examples, for every prime p≥ 7 we construct A, B of size p-1 with a single ternary relation such that PCSP(A, B) reduces via A→ C→ B to a tractable CSP over some C of size p but not over any smaller structure. In contrast we show that if A, B are graphs and PCSP(A,B) reduces to tractable CSP(C) for some finite C, then already A or B has tractable CSP. This extends results and answers a question of Deng et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2020

Sandwiches for Promise Constraint Satisfaction

Promise Constraint Satisfaction Problems (PCSP) were proposed recently b...
research
06/23/2020

A Note on the Cross-Correlation of Costas Permutations

We build on the work of Drakakis et al. (2011) on the maximal cross-corr...
research
05/26/2020

Nonmonotonic Inferences with Qualitative Conditionals based on Preferred Structures on Worlds

A conditional knowledge base R is a set of conditionals of the form "If ...
research
09/11/2019

Promises Make Finite (Constraint Satisfaction) Problems Infinitary

The fixed template Promise Constraint Satisfaction Problem (PCSP) is a r...
research
10/09/2018

Uniform CSP Parameterized by Solution Size is in W[1]

We show that the uniform Constraint Satisfaction Problem (CSP) parameter...
research
01/08/2018

Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices

We prove that for any positive integers n and k such that n≥ k≥ 1, there...
research
03/27/2013

Problem Structure and Evidential Reasoning

In our previous series of studies to investigate the role of evidential ...

Please sign up or login with your details

Forgot password? Click here to reset