首页/论文/2011.03978

arXiv 2011.039782020-11cs.LOcs.CCmath.LOmath.RA

Smooth approximations and CSPs over finitely bounded homogeneous structures

Antoine Mottet, Michael Pinsker

备注：: 42 pages. Latest version: added details to many proofs

英文摘要：

We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the order of the rationals. Apart from obtaining these dichotomy results, we show how our new proof technique allows to unify and significantly simplify the previous results from the literature. For all but the last structure, we moreover characterize those CSPs which are solvable by local consistency methods, again using the same machinery.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

一元结构一阶归约的二分法

A Dichotomy for First-Order Reducts of Unary Structures

本文研究有限有界齐次结构归约的约束满足问题，提出从无限域到有限域的多项式时间归约，并利用拓扑多态性克隆获得可解性条件，进而证明Bodirsky-Pinsker猜想对一元语言归约类成立。

2018-05-20cs.CCcs.LOmath.LO

ASNP: a tame fragment of existential second-order logic

Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that ASNP has a complexity dichotomy if and only if the infinite-domain dichotomy conjecture holds for constraint satisfaction problems for first-order reducts of binary finitely bounded homogeneous structures. For such CSPs, powerful universal-algebraic hardness conditions are know…

2020-01-28cs.CCcs.LOmath.LO

从无中生有的序：无限域约束满足问题的新算法

An order out of nowhere: a new algorithm for infinite-domain CSPs

本文针对有限一致超图上的约束可满足性问题，提出一种基于外部线性序对称性的新算法，并证明其正确性，进而给出P/NP-完全复杂性二分法，证实了Bodirsky-Pinsker猜想，推广了先前关于图可满足性的工作。

2025-08-22cs.CCcs.LOmath.LO

The wonderland of reflections

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable ω-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 th…

2017-01-24cs.CCcs.LOmath.LO

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP sentence is computationally equivalent to a finite-domain constraint satisfaction problem (CSP); the involved probabilistic reductions were derandomized by Kun using explicit constructions of expander structures. We present a new proof of the reduction to finite-domain CSPs which does not rely on the results of Kun. This new proof allows us to obtain a stronger…

2020-11-25cs.CCcs.LOmath.LO

有限有界同构结构上的约束满足问题：FO与L难之间的二元性

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard

Faculty of Mathematics and Computer Science, Jagiellonian University（雅盖隆大学数学与计算机科学学院）

本文证明了有限有界同构模型完全核心的第一阶扩展的CSP要么可由一阶定义（非均匀AC$^0$），要么在第一阶约简下为L难。该结果是Bodirsky-Pinsker猜想范围内最一般的复杂性二元性。

2026-07-16cs.CCcs.LO

更多相关论文收起更多论文

ω-categorical structures avoiding height 1 identities

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 the condition of having polymorphisms satisfying a fixed set of identities of height 1, i.e., identitie…

2021-01-11cs.LOmath.LOmath.RA

On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width

The relational width of a finite structure, if bounded, is always (1,1) or (2,3). In this paper we study the relational width of first-order expansions of finitely bounded homogeneous binary cores where binary cores are structures with equality and some anti-reflexive binary relations such that for any two different elements a, b in the domain there is exactly one binary relation R with (a, b) in R. Our main result is that first-order expansions of liberal finitely bounded homogeneous binary cores with bounded strict width have relational width (2, MaxBound) where MaxBound is the size of the l…

2020-05-08cs.LO

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

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 when the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise. One of the important questions related to this 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…

2019-05-17cs.CCcs.LOmath.LO

Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)

The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction, in some precise technical sense, from the 3-SAT problem; otherwise, they are NP-complete. Its recent resolution draws on an algebraic characterization of the conjectured borderline: the CSP of a finite structure permits no natural reduction from 3-SAT if and only if the stabilizer of the polymorphism clone of the core of the structure satisfies some nontrivial system of identities, and such satisfaction is always wit…

2021-01-11cs.LO

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems

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 to the clone of projections, and that this happens if and only if its polymorphism clone does not contain operations $α$, $β$, $s$ satisfying the identity $αs(x,y,x,z,y,z) \approx βs(y,x,z,x,z,y)$. This establishes an algebraic criterion equivalent to the conjectured borderline between P and NP-complete CSPs over reducts of finitely bounded homogenous structures, and accomplishes one of the steps of a…

2016-02-13cs.CCcs.LOmath.LO

具有有限对偶性的齐次结构上约束满足问题的严格宽度

Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality

研究无限域 CSP 中严格宽度的局部一致性蕴含全局一致性原则，证明有界严格宽度对模板表达能力的具体影响并给出关系宽度显式界限，且克服了先前工作对二元签名的限制。

2024-02-15cs.LO

有限有界同质性的内外翻转

Finitely Bounded Homogeneity Turned Inside-Out

本文将有限有界类的合并性质判定归约联系于归约包含问题，证明其2NEXPTIME困难，并在可计算有限有界Ramsey扩张假设下给出可判定性，同时证明可齐次化检验不可判定。

2025-08-31cs.LOmath.LO

准有向Jónsson运算蕴含有界宽度（针对具有自由融合的对称二元核心的fo-展开）

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation)

本文证明准有向Jónsson运算链对具有自由融合的对称二元核心的fo-展开这一大类无限结构蕴含可驯性与有界宽度，填补了无限域CSP代数可驯性猜想中除准近一致运算外缺乏已知可驯性运算系统的空白。

2024-02-26cs.LO

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width

Solving the algebraic dichotomy conjecture for constraint satisfaction problems over structures first-order definable in countably infinite finitely bounded homogeneous structures requires understanding the applicability of local-consistency methods in this setting. We study the amount of consistency (measured by relational width) needed to solve CSP for first-order expansions S of countably infinite homogeneous graphs that additionally have bounded strict width, i.e., for which establishing local consistency of an instance of the CSP not only decides if there is a solution but also ensures th…

2020-01-18cs.LO

自动结构的二元定理

A Dichotomy Theorem for Homomorphism Problems on Automatic Structures

ENS Ulm, France（法国高等师范学院乌尔姆分校）；Université de Lille（里尔大学）

本文提出自动结构上的同态问题存在二元定理，即问题要么在NL中可决定，要么不可决定，并通过有限对偶性刻画可决定性。

2026-10-20cs.FLcs.LO