Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

01/14/2019
by   Manuel Bodirsky, et al.
0

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise. One of the important questions related to this conjecture is whether, similarly to the case of finite structures, the condition of having a pseudo-Siggers polymorphism can be replaced by the condition of having polymorphisms satisfying a fixed set of identities of height 1, i.e., identities which do not contain any nesting of functional symbols. We provide a negative answer to this question by constructing for each non-trivial set of height 1 identities a structure whose polymorphisms do not satisfy these identities, but whose CSP is tractable nevertheless. An equivalent formulation of the dichotomy conjecture characterizes tractability of the CSP via the local satisfaction of non-trivial height 1 identities by polymorphisms of the structure. We show that local satisfaction and global satisfaction of non-trivial height 1 identities differ for ω-categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.

READ FULL TEXT
research
01/14/2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
06/13/2020

ω-categorical structures avoiding height 1 identities

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
09/12/2019

Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)

The tractability conjecture for finite domain Constraint Satisfaction Pr...
research
12/02/2018

Pseudo-loop conditions

We initiate the systematic study of loop conditions of arbitrary finite ...
research
04/13/2020

Cores over Ramsey structures

It has been conjectured that the class of first-order reducts of finitel...
research
02/21/2020

Temporal Constraint Satisfaction Problems in Fixed-Point Logic

Finite-domain constraint satisfaction problems are either solvable by Da...
research
02/17/2020

When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

We produce a class of ω-categorical structures with finite signature by ...

Please sign up or login with your details

Forgot password? Click here to reset