ACTA issues

Finite uniform lattices are congruence permutable

Kalle Kaarli

Acta Sci. Math. (Szeged) 71:3-4(2005), 457-460

Abstract. An algebra is called uniform if all classes of any of its congruences are of the same size. We prove that every finite uniform lattice is congruence permutable. We also show that this result extends neither to arbitrary finite algebras nor to infinite lattices.

AMS Subject Classification (1991): 06B10

Received November 18, 2004. (Registered under 5881/2009.)