In 2002 Thakare, Pawar and Waphare counted non-isomorphic lattices on n elements, containing exactly two reducible elements. In this paper, we count the non-isomorphic lattices on n elements, containing exactly three reducible elements. This work is in respect of Birkhoff's open problem of enumerating all finite lattices on n elements.
No takes yet. Share an insight, caveat, or question.
Bhavale et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: