ω-CATEGORICAL STRUCTURES AVOIDING HEIGHT 1 IDENTITIES

被引:9
作者
Bodirsky, Manuel [1 ]
Mottet, Antoine [2 ]
Olsak, Miroslav [2 ]
Oprsal, Jakub [3 ]
Pinsker, Michael [2 ,4 ]
Willard, Ross [5 ]
机构
[1] Tech Univ Dresden, Inst Algebra, Dresden, Germany
[2] Charles Univ Prague, Dept Algebra, Prague, Czech Republic
[3] Univ Durham, Dept Comp Sci, Durham, England
[4] Tech Univ Wien, Inst Discrete Math & Geometry, Vienna, Austria
[5] Univ Waterloo, Dept Pure Math, Waterloo, ON, Canada
基金
欧洲研究理事会; 奥地利科学基金会; 加拿大自然科学与工程研究理事会; 英国工程与自然科学研究理事会;
关键词
Mal'cev condition; nonnested identity; pointwise convergence topology; omega-categoricity; orbit growth; homogeneous structure; finite boundedness; constraint satisfaction problem; complexity dichotomy; CONSTRAINT SATISFACTION;
D O I
10.1090/tran/8179
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.-categorical structures with less than doubly exponential orbit growth, thereby resolving one of the main open problems in the algebraic theory of such structures.
引用
收藏
页码:327 / 350
页数:24
相关论文
共 39 条
  • [1] The hardness of approximate optima in lattices, codes, and systems of linear equations
    Arora, S
    Babai, L
    Stern, J
    Sweedyk, Z
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 54 (02) : 317 - 331
  • [2] POLYNOMIAL INTERPOLATION AND CHINESE REMAINDER THEOREM FOR ALGEBRAIC SYSTEMS
    BAKER, KA
    PIXLEY, AF
    [J]. MATHEMATISCHE ZEITSCHRIFT, 1975, 143 (02) : 165 - 174
  • [3] Barto L., 2017, Dagstuhl Follow-Ups, V7, P1
  • [4] TOPOLOGY IS IRRELEVANT (IN A DICHOTOMY CONJECTURE FOR INFINITE DOMAIN CONSTRAINT SATISFACTION PROBLEMS)
    Barto, Libor
    Pinsker, Michael
    [J]. SIAM JOURNAL ON COMPUTING, 2020, 49 (02) : 365 - 393
  • [5] Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
    Barto, Libor
    Kompatscher, Michael
    Olsak, Miroslav
    Trung Van Pham
    Pinsker, Michael
    [J]. JOURNAL OF MATHEMATICAL LOGIC, 2019, 19 (02)
  • [6] The wonderland of reflections
    Barto, Libor
    Oprsal, Jakub
    Pinsker, Michael
    [J]. ISRAEL JOURNAL OF MATHEMATICS, 2018, 223 (01) : 363 - 398
  • [7] Barto L, 2017, IEEE S LOG
  • [8] The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
    Barto, Libor
    Pinsker, Michael
    [J]. PROCEEDINGS OF THE 31ST ANNUAL ACM-IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2016), 2016, : 615 - 622
  • [9] Constraint Satisfaction Problems Solvable by Local Consistency Methods
    Barto, Libor
    Kozik, Marcin
    [J]. JOURNAL OF THE ACM, 2014, 61 (01)
  • [10] Bodirsky M., J SYMBOLIC LOGIC