Zero Divisor Graph of a Lattice and Its Unique Ideal

Let L be a lattice with the least element 0. Let AL be the finite set of atoms with AL>1 and ΓL be the zero divisor graph of a lattice L. In this paper, we introduce the smallest finite, distributive, and uniquely complemented ideal B of a lattice L having the same number of atoms as that of L and study the properties of ΓL and ΓB.

Single identities forcing lattices to be Boolean

In this note we characterize Boolean algebras among lattices of type (2, 2, 1) with join, meet and an additional unary operation by means of single two-variable respectively three-variable identities. In particular, any uniquely complemented lattice satisfying any one of these equational constraints is distributive and hence a Boolean algebra.

The Macneille Completion of a Uniquely Complemented Lattice

Problem 36 of the third edition of Birkhoff's Lattice theory [2] asks whether the MacNeille completion of uniquely complemented lattice is necessarily uniquely complemented. We show that the MacNeille completion of a uniquely complemented lattice need not be complemented.