The wonderland of reflections
Libor Barto, Jakub Opr\v{s}al, Michael Pinsker

TL;DR
This paper extends the algebraic framework for classifying the complexity of constraint satisfaction problems (CSPs) over -categorical structures by introducing new algebraic and syntactic tools, leading to a refined dichotomy conjecture.
Contribution
It introduces the concept of reflection and h1 clone homomorphisms, broadening the algebraic approach to CSPs and proposing a new dichotomy conjecture for reducts of finitely bounded homogeneous structures.
Findings
Complexity depends on identities of height 1 in polymorphism clones.
Introduces reflection as a new semantic construction.
Establishes a connection between h1 clone homomorphisms and lattice interpretability.
Abstract
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for their polymorphism clones: a semantic one via the standard algebraic operators H, S, P, and a syntactic one via clone homomorphisms (capturing identities). We provide a similar characterization which incorporates all relational constructions relevant for CSPs, that is, homomorphic equivalence and adding singletons to cores in addition to pp-interpretations. For the semantic part we introduce a new construction, called reflection, and for the syntactic part we find an appropriate weakening of clone homomorphisms, called h1 clone homomorphisms (capturing identities of height 1). As a consequence, the complexity of the CSP of an at most countable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
