pith. sign in

arxiv: 1612.07648 · v2 · pith:QWWIQUGNnew · submitted 2016-12-21 · 🧮 math.GM

The lattice of congruence lattices of algebras on a finite set

classification 🧮 math.GM
keywords mathcalfinitelatticealgebrascongruencedeterminedlatticesmapping
0
0 comments X
read the original abstract

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined by a single unary mapping on $A$, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set $A$. Using these characterizations we deduce several properties of the lattice $\mathcal E$; in particular, we prove that $\mathcal E$ is tolerance-simple whenever $|A|\geq 4$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.