Counting of lattices containing up to reducible elements and having nullity up to
arXiv:2407.06736
Abstract
In this paper, we count all non-isomorphic lattices on elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on elements.
13 pages