A note on finite lattices with many congruences
classification
🧮 math.RA
keywords
congruenceselementlatticesdescribeexactlyfinitefreeselattice
read the original abstract
By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the $n$-element lattices with exactly $2^{n-2}$ congruences.
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.