1,000 research outputs found

    Characterizing fully principal congruence representable distributive lattices

    Get PDF
    Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice DD is said to be fully principal congruence representable if for every subset QQ of DD containing 00, 11, and the set J(D)J(D) of nonzero join-irreducible elements of DD, there exists a finite lattice LL and an isomorphism from the congruence lattice of LL onto DD such that QQ corresponds to the set of principal congruences of LL under this isomorphism. Based on earlier results of G. Gr\"atzer, H. Lakser, and the present author, we prove that a finite distributive lattice DD is fully principal congruence representable if and only if it is planar and it has at most one join-reducible coatom. Furthermore, even the automorphism group of LL can arbitrarily be stipulated in this case. Also, we generalize a recent result of G. Gr\"atzer on principal congruence representable subsets of a distributive lattice whose top element is join-irreducible by proving that the automorphism group of the lattice we construct can be arbitrary.Comment: 20 pages, 8 figure
    corecore