Counting of Lattices Containing up to 4 Reducible Elements and having Nullity up to 3
In this paper, we count all non-isomorphic lattices on n elements, containing four reducible elements and having nullity three. This work is with respect to Birkhoff’s open problem (which is NP-complete) of counting all finite lattices on n elements.