Home
Scholarly Works
Idempotent n‐permutable varieties
Journal article

Idempotent n‐permutable varieties

Abstract

One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n‐permutable for some n. In this paper, we prove two results: (1) for every n>1, there is a polynomial‐time algorithm that, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n‐permutable and (2) a variety is n‐permutable for some n if and only if it interprets an idempotent variety that is not interpretable in the variety of distributive lattices.

Authors

Valeriote M; Willard R

Journal

Bulletin of the London Mathematical Society, Vol. 46, No. 4, pp. 870–880

Publisher

Wiley

Publication Date

January 1, 2014

DOI

10.1112/blms/bdu044

ISSN

0024-6093

Labels

Contact the Experts team