The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Abstract
We prove that an -categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that this happens if and only if its polymorphism clone does not contain operations , , satisfying the identity . This establishes an algebraic criterion equivalent to the conjectured borderline between P and NP-complete CSPs over reducts of finitely bounded homogenous structures, and accomplishes one of the steps of a proposed strategy for reducing the infinite domain CSP dichotomy conjecture to the finite case. Our theorem is also of independent mathematical interest, characterizing a topological property of any -categorical core structure (the existence of a continuous homomorphism of a stabilizer of its polymorphism clone to the projections) in purely algebraic terms (the failure of an identity as above).
Cite
@article{arxiv.1602.04353,
title = {The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems},
author = {Libor Barto and Michael Pinsker},
journal= {arXiv preprint arXiv:1602.04353},
year = {2016}
}
Comments
15 pages