𝜔-categorical structures avoiding height 1 identities
- 14 October 2020
- journal article
- research article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 374 (1) , 327-350
Abstract
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 is 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 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 nontrivial set of height 1 identities a structure within the range of the conjecture 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 nontrivial height 1 identities by polymorphisms of the structure. We show that local satisfaction and global satisfaction of nontrivial height 1 identities differ for ω \omega -categorical structures with less than doubly exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.Keywords
All Related Versions
Funding Information
- European Research Council (681988)
- European Research Council (771005)
- European Research Council (681988)
- European Research Council (EP/R034516/1)
- European Research Council (P32337)
- European Research Council (13-01832S)
- H2020 European Research Council (681988)
- H2020 European Research Council (771005)
- H2020 European Research Council (681988)
- H2020 European Research Council (EP/R034516/1)
- H2020 European Research Council (P32337)
- H2020 European Research Council (13-01832S)
- H2020 European Research Council (681988)
- H2020 European Research Council (771005)
- H2020 European Research Council (681988)
- H2020 European Research Council (EP/R034516/1)
- H2020 European Research Council (P32337)
- H2020 European Research Council (13-01832S)
- Engineering and Physical Sciences Research Council (681988)
- Engineering and Physical Sciences Research Council (771005)
- Engineering and Physical Sciences Research Council (681988)
- Engineering and Physical Sciences Research Council (EP/R034516/1)
- Engineering and Physical Sciences Research Council (P32337)
- Engineering and Physical Sciences Research Council (13-01832S)
- Austrian Science Fund (681988)
- Austrian Science Fund (771005)
- Austrian Science Fund (681988)
- Austrian Science Fund (EP/R034516/1)
- Austrian Science Fund (P32337)
- Austrian Science Fund (13-01832S)
- Grantová Agentura České Republiky (681988)
- Grantová Agentura České Republiky (771005)
- Grantová Agentura České Republiky (681988)
- Grantová Agentura České Republiky (EP/R034516/1)
- Grantová Agentura České Republiky (P32337)
- Grantová Agentura České Republiky (13-01832S)
- Natural Sciences and Engineering Research Council of Canada (681988)
- Natural Sciences and Engineering Research Council of Canada (771005)
- Natural Sciences and Engineering Research Council of Canada (681988)
- Natural Sciences and Engineering Research Council of Canada (EP/R034516/1)
- Natural Sciences and Engineering Research Council of Canada (P32337)
- Natural Sciences and Engineering Research Council of Canada (13-01832S)
This publication has 33 references indexed in Scilit:
- Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structuresJournal of Mathematical Logic, 2019
- A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP2018
- The Complexity of Phylogeny Constraint Satisfaction ProblemsACM Transactions on Computational Logic, 2017
- The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems2017
- A Model-Theoretic View on Qualitative Constraint ReasoningJournal of Artificial Intelligence Research, 2017
- Constraint Satisfaction Problems Solvable by Local Consistency MethodsJournal of the ACM, 2014
- The complexity of temporal constraint satisfaction problemsJournal of the ACM, 2010
- Non-dichotomies in Constraint Satisfaction Complexity2008
- Classifying the Complexity of Constraints Using Finite AlgebrasSIAM Journal on Computing, 2005
- The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear EquationsJournal of Computer and System Sciences, 1997