Counting of lattices containing up to $4$ reducible elements and having nullity up to $3$
Ashok Nivrutti Bhavale
公開日: 2024/7/9
Abstract
In this paper, we count all non-isomorphic lattices on $n$ 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 $n$ elements.