DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS

Abstract In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some given n . We show that for such “path defined” Maltsev conditions, the decision problem is polynomial-time solvable.