Finite semilattices with many congruences (Q2314421): Difference between revisions

The aim of this paper is to determine the maximal size of the congruence lattice of a finite semilattice \(S\). The following result is proved. Theorem. Let \(S\) be a finite meet-semilattice of size \(n\). The following holds: \begin{itemize} \item[(i)] \(S\) has at most \(2^{n-1}\) congruences, the equality holds if \(S\) is a tree. \item[(ii)] if \(S\) has less than \(2^{n-1}\) congruences then it has at most \(28.2^{n-6}\) congruences and the equality holds if and only if \(S\) is a quasi-tree. \item[(iii)] If \(S\) has less than \(28.2^{n-6}\) conguences then it has at most \(26.2^{n-6}\) congruences. The equality holds if and only if \(S\) is a quasi-tree whose nucleus is \(N_5\). \item[(iv)] If \(S\) has less then \(26.2^{n-6}\) congruences then it has at most \(25.2^{n-6}\) congruences. \end{itemize} Corollary. If an \(n\)-element meet-semilattice has at least \(25.2^{n-6}\) congruences, then it is planar.