Ω-categorical Structures Avoiding Height 1 Identities

@article{Bodirsky2020categoricalSA,
  title={$\Omega$-categorical Structures Avoiding Height 1 Identities},
  author={M. Bodirsky and Antoine Mottet and M. Ols{\'a}k and Jakub Opr{\vs}al and Michael Pinsker and R. Willard},
  journal={ArXiv},
  year={2020},
  volume={abs/2006.12254}
}
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 if the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise. One of the important questions related to the dichotomy conjecture is whether, similarly to the case of finite structures, the condition of having a pseudo-Siggers polymorphism can be replaced by… Expand

References

SHOWING 1-10 OF 72 REFERENCES
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)
TLDR
It is shown that local satisfaction and global satisfaction of non-trivial height 1 identities differ for $\omega$-categorical structures with less than double exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures. Expand
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
  • L. Barto, Michael Pinsker
  • Computer Science, Mathematics
  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
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 toExpand
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures
TLDR
It is proved that any polymorphism of sufficiently large arity which is totally symmetric modulo outer embeddings of a finitely bounded structure can be turned into a non-trivial system of linear identities, and obtain non-Trivial linear identities for all tractable cases of reducts of the rational order, the random graph, and the random poset. Expand
The wonderland of reflections
TLDR
A new elegant dichotomy conjecture for the CSPs of reducts of finitely bounded homogeneous structures is formulated and a close connection between h1 clone homomorphisms and the notion of compatibility with projections used in the study of the lattice of interpretability types of varieties is revealed. Expand
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems
TLDR
T tractability of the CSP of a reducts of finitely bounded homogeneous structures is equivalent to the linear identities satisfied by its polymorphisms clone, together with the natural uniformity on it, being non-trivial. Expand
Constraint Satisfaction with Countable Homogeneous Templates
TLDR
It is proved that the primitive positive definable relations over an ω-categorical structure Γ are precisely the relations that are preserved by the polymorphisms of Γ. Expand
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
TLDR
This work presents a new proof of the reduction to finite-domain CSPs that does not rely on the results of Kun, and uses the universal-algebraic approach to study the computational complexity of MMSNP. Expand
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Computer Science, Mathematics
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
TLDR
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy. Expand
Non-dichotomies in Constraint Satisfaction Complexity
TLDR
It is shown that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template and that if the so-called local-global conjecture for infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraints satisfaction problem for infinite constraints languages. Expand
...
1
2
3
4
5
...