DeepAI AI Chat
Log In Sign Up

Existence of cube terms in finite finitely generated clones

01/15/2019
by   Alexandr Kazda, et al.
0

We study the problem of whether a given finite clone generated by finitely many operations contains a cube term and give both structural and algorithmic results. We show that if such a clone has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of the generators of the clone and the size of the basic set. For idempotent clones we give a tight bound on N that matches an earlier result of K. Kearnes and A. Szendrei. On the algorithmic side, we show that deciding the existence of cube terms is in P for idempotent clones and in EXPTIME in general. Since a clone contains a k-ary near unanimity operation if and only if it contains a cube term and a chain of Jónsson terms, our results can also be also used to decide whether a given finite algebra has a near unanimity operation.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/14/2020

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...
11/16/2020

Polynomial-time Tests for Difference Terms in Idempotent Varieties

We consider the following practical question: given a finite algebra A i...
01/02/2019

Deciding the existence of minority terms

This paper investigates the computational complexity of deciding if a gi...
03/21/2018

The Subpower Membership Problem for Finite Algebras with Cube Terms

The subalgebra membership problem is the problem of deciding if a given ...
09/08/2022

Apartness relations between propositions

We classify all apartness relations definable in propositional logics ex...
11/03/2017

Word problems in Elliott monoids

Algorithmic issues concerning Elliott local semigroups are seldom consid...
09/05/2021

The local-global property for G-invariant terms

For some Maltsev conditions Σ it is enough to check if a finite algebra ...