DeepAI

# 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 if a finite algebra A admits a k-ary weak near unanimity operation by looking at the local behavior of the terms of A. We also observe that the problem of deciding if a given finite algebra has a quasi Taylor operation is solvable in polynomial time by looking, essentially, for local quasi Siggers operations.

09/28/2020

### Digraph homomorphism problem and weak near unanimity polymorphism

We consider the problem of finding a homomorphism from an input digraph ...
01/15/2019

### Existence of cube terms in finite finitely generated clones

We study the problem of whether a given finite clone generated by finite...
01/02/2019

### Deciding the existence of minority terms

This paper investigates the computational complexity of deciding if a gi...
11/03/2017

### Word problems in Elliott monoids

Algorithmic issues concerning Elliott local semigroups are seldom consid...
04/13/2020

### Congruence Preservation, Lattices and Recognizability

Looking at some monoids and (semi)rings (natural numbers, integers and p...
08/22/2020

### Digraphs Homomorphism Problems with Maltsev Condition

We consider a generalization of finding a homomorphism from an input dig...
10/19/2022

### On Bisimulation in Absence of Restriction

We revisit the standard bisimulation equalities in process models free o...