MVLSC Home • Issue Contents

Deciding the Existence of QuasiWeak Near Unanimity Terms in Finite Algebras
Alexandr Kazda

We show that for a fixed positive integer 𝑘 one can efficiently decide if a finite algebra 𝐴 admits a 𝑘-ary weak near unanimity operation by looking at the local behavior of the terms of 𝐴. 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.

Keywords: Computational complexity, Maltsev condition, Taylor term, weak near unanimity, local to global

Full Text (IP)