Symmetries of structures that fail to interpret something finite

02/23/2023
by   Libor Barto, et al.
0

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize several theorems from the literature and yield further algebraic invariance properties that must be satisfied in every such graph. Algebraic properties of this kind are tightly connected to the tractability of constraint satisfaction problems, and we obtain new such properties even for infinite countably categorical graphs. We balance these positive results by showing the existence of a countably categorical hypergraph that fails to interpret some finite structure, while still lacking some of the most essential algebraic invariance properties known to hold for finite structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2009

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

The universal-algebraic approach has proved a powerful tool in the study...
research
02/17/2020

When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

We produce a class of ω-categorical structures with finite signature by ...
research
09/12/2019

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

The tractability conjecture for finite domain Constraint Satisfaction Pr...
research
10/21/2021

Polyadic Sets and Homomorphism Counting

A classical result due to Lovasz (1967) shows that the isomorphism type ...
research
06/13/2020

ω-categorical structures avoiding height 1 identities

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
03/29/2023

Two algorithms to decide Quantifier-free Definability in Finite Algebraic Structures

This work deals with the definability problem by quantifier-free first-o...
research
03/09/2023

On the Expressiveness and Generalization of Hypergraph Neural Networks

This extended abstract describes a framework for analyzing the expressiv...

Please sign up or login with your details

Forgot password? Click here to reset