• Corpus ID: 226281389

Smooth approximations and CSPs over finitely bounded homogeneous structures

@article{Mottet2020SmoothAA,
  title={Smooth approximations and CSPs over finitely bounded homogeneous structures},
  author={Antoine Mottet and Michael Pinsker},
  journal={ArXiv},
  year={2020},
  volume={abs/2011.03978}
}
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… 
3 Citations

Figures from this paper

Smooth Approximations and Relational Width Collapses
TLDR
A characterization of bounded width for first-order reducts of unary structures and a characterization of MMSNP sentences that are equivalent to a Datalog program are obtained, answering a question posed by Bienvenu et al.
L O ] 1 5 Fe b 20 21 SMOOTH APPROXIMATIONS AND RELATIONAL WIDTH COLLAPSES
We prove that relational structures admitting specific polymorphisms (namely, canonical pseudo-WNU operations of all arities n ≥ 3) have low relational width. This implies a collapse of the bounded
CORES OVER RAMSEY STRUCTURES
TLDR
It is proved that if an $\omega $ -categorical structure has an $\Categorical homogeneous Ramsey expansion, then so does its model-complete core.

References

SHOWING 1-10 OF 68 REFERENCES
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
TLDR
Two new characterizations of finitely generated Taylor varieties are provided using absorbing subalgebras and cyclic terms, allowing to reprove the conjecture of Bang-Jensen and Hell and the characterization of locally finite Taylor varieties using weak near- unanimity terms in an elementary and self-contained way.
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.
The reducts of equality up to primitive positive interdefinability
TLDR
It turns out that there exists a continuum of reducts of relational structures up to primitive positive interdefinability, and those locally closed clones over a countable domain which contain all permutations of the domain are classified.
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width
TLDR
This work studies the amount of consistency 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 that every solution may be obtained from a locally consistent instance by greedily assigning values to variables.
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
  • M. Bodirsky, Antoine Mottet
  • Computer Science, Mathematics
    2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
TLDR
This paper shows that the tractability conjecture for reducts of finitely bounded homogeneous structures is for $\mathcal{C}$ equivalent to the finite-domain tractable conjecture, and studies the subclass of CSPs for structures that are first-order definable over equality with parameters.
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.
A Dichotomy for First-Order Reducts of Unary Structures
TLDR
This work uses a general polynomial-time reduction from such infinite-domain CSPs to finite- domains to obtain new powerful polynometric-time tractability conditions that can be expressed in terms of the topological polymorphism clone of A.
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.
Automorphism groups and Ramsey properties of sparse graphs
TLDR
It is shown that Hrushovski's example of an $\omega$-categorical sparse graph has no $\omegas$- categorical expansion with extremely amenable automorphism group, resolving one of the open questions in the area.
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.
...
1
2
3
4
5
...