Counting of Lattices on up to Three Reducible Elements
In 1940, Birkhoff posed an open problem regarding the enumeration of finite lattices with n elements. Thakare, Pawar and Waphare gave a partial solution to this problem and enumerated non-isomorphic lattices with n elements and up to n + 1 edges. In this paper, we count the non-isomorphic lattices with n elements and containing exactly three reducible elements.