𝜔-categorical structures avoiding height 1 identities

Author:

Bodirsky Manuel,Mottet Antoine,Olšák Miroslav,Opršal Jakub,Pinsker Michael,Willard Ross

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.

Funder

European Research Council

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference40 articles.

1. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora, Sanjeev;J. Comput. System Sci.,1997

2. [BBKO19] Libor Barto, Jakub Bulín, Andrei Krokhin, and Jakub Opršal. Algebraic approach to promise constraint satisfaction. arXiv:1811.00970v3, 2019.

3. Non-dichotomies in constraint satisfaction complexity;Bodirsky, Manuel,2008

4. A model-theoretic view on qualitative constraint reasoning;Bodirsky, Manuel;J. Artificial Intelligence Res.,2017

5. Classifying the complexity of constraints using finite algebras;Bulatov, Andrei;SIAM J. Comput.,2005

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures;Journal of the ACM;2024-08-17

2. Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. Corrigendum to “-categorical structures avoiding height 1 identities”;Transactions of the American Mathematical Society;2023-01-27

4. CLAP: A New Algorithm for Promise CSPs;SIAM Journal on Computing;2023-01-25

5. Smooth approximations and CSPs over finitely bounded homogeneous structures;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3