Computing congruence lattices of finite lattices
Ralph Freese
Abstract
Open-access reader
Ralph Freese
Abstract
Open-access reader
An inequality between the number of coverings in the ordered set J ( C o n J ) \operatorname {J}({\mathbf {Con\;J}}) of join irreducible congruences on a lattice L \operatorname {L} and the size of L {\mathbf {L}} is given. Using this inequality it is shown that this ordered set can be computed in time O ( n 2 log 2 n ) O(n^2 \log _2 n) , where n = | L | n=|L| .
OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An inequality between the number of coverings in the ordered set J ( C o n J ) \operatorname {J}({\mathbf {Con\;J}}) of join irreducible congruences on a lattice L \operatorname {L} and the size of L {\mathbf {L}} is given. Using this inequality it is shown that this ordered set can be computed in time O ( n 2 log 2 n ) O(n^2 \log _2 n) , where n = | L | n=|L| .
Key concepts: Congruence (geometry), Congruence relation, Mathematics, Join (topology), Lattice (music), Combinatorics, Inequality, Complete lattice