Smooth approximations and CSPs over finitely bounded homogeneous structures

11/08/2020
by   Antoine Mottet, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2021

WENO interpolations and reconstructions using data bounded polynomial approximation

This work characterizes the structure of third and forth order WENO weig...
research
01/18/2020

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

Solving the algebraic dichotomy conjecture for constraint satisfaction p...
research
02/21/2018

WQO dichotomy for 3-graphs

We investigate data-enriched models, like Petri nets with data, where ex...
research
04/13/2020

Cores over Ramsey structures

It has been conjectured that the class of first-order reducts of finitel...
research
05/08/2020

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) ...
research
12/16/2019

The polynomial method for list-colouring extendability of outerplanar graphs

We restate theorems of Hutchinson on list-colouring extendability for ou...

Please sign up or login with your details

Forgot password? Click here to reset