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

05/08/2020
by   Michał Wrona, et al.
0

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 largest forbidden substructure, but is not less than 3, and liberal stands for structures that do not forbid certain finite structures of small size. This result is built on a new approach and concerns a broad class of structures including reducts of homogeneous digraphs for which the CSP complexity classification has not yet been obtained.

READ FULL TEXT

page 1

page 2

page 3

page 4

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/13/2021

Twin-width and permutations

Inspired by a width invariant defined on permutations by Guillemot and M...
research
04/21/2021

On the Width of Regular Classes of Finite Structures

In this work, we introduce the notion of decisional width of a finite re...
research
02/15/2021

Smooth Approximations and Relational Width Collapses

We prove that relational structures admitting specific polymorphisms (na...
research
09/12/2019

Examples, counterexamples, and structure in bounded width algebras

We study bounded width algebras which are minimal in the sense that ever...
research
11/08/2020

Smooth approximations and CSPs over finitely bounded homogeneous structures

We develop the novel machinery of smooth approximations, and apply it to...
research
07/05/2023

Expressiveness Results for an Inductive Logic of Separated Relations

In this paper we study a Separation Logic of Relations (SLR) and compare...

Please sign up or login with your details

Forgot password? Click here to reset