DeepAI AI Chat
Log In Sign Up

Digraph homomorphism problem and weak near unanimity polymorphism

by   Tomas Feder, et al.

We consider the problem of finding a homomorphism from an input digraph G to a fixed digraph H. We show that if H admits a weak near unanimity polymorphism ϕ then deciding whether G admits a homomorphism to H (HOM(H)) is polynomial-time solvable. This gives proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov and Zhuk. We have implemented our algorithm and show some experimental results. We use our algorithm together with the recent result [38] for recognition of Maltsev polymorphisms and decide in polynomial time if a given relational structure ℛ admits a weak near unanimity polymorphism.


page 1

page 2

page 3

page 4


Digraphs Homomorphism Problems with Maltsev Condition

We consider a generalization of finding a homomorphism from an input dig...

Deciding the existence of quasi weak near unanimity terms in finite algebras

We show that for a fixed positive integer k one can efficiently decide i...

The parameterized complexity of finding a 2-sphere in a simplicial complex

We consider the problem of finding a subcomplex K' of a simplicial compl...

Optimization over Young Diagrams

We consider the problem of finding a Young diagram minimizing the sum of...

Embedding graphs into two-dimensional simplicial complexes

We consider the problem of deciding whether an input graph G admits a to...

(weak) Calibration is Computationally Hard

We show that the existence of a computationally efficient calibration al...

Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning

We present a first theoretical analysis of the power of polynomial-time ...