Keywords:-
Article Content:-
Abstract
In $2020$, Bhavale and Waphare introduced the concepts of fundamental basic block and basic
block, associated to dismantlable lattices.
Further, they have provided the recursive formulae of the number of non-isomorphic fundamental basic
blocks as well as basic blocks, containing $r$ comparable reducible elements and having nullity $l$.
In this paper, we actually obtain the Hasse diagrams of the basic blocks containing four
comparable reducible elements and having nullity four.
References:-
References
Birkhoff G., Lattice Theory vol. 25., Amer. Math. Soc. Colloq., Pub. New Delhi (1979).
Brinkmann G., McKay B. D., Posets on up to 16 points, Order, (19)(2002) 147--179.
Heitzig J., Reinhold J., Counting finite lattices, Algebra Universalis, 48(1)(2002) 43--53.
Bhavale A. N., Waphare B. N., Basic retracts and counting of lattices, Australas. J. Combin., 78(1)(2020) 73--99.
Rival I., Lattices with doubly irreducible elements, Canad. Math. Bull., (17)(1974) 91--95.
Gr{"a}tzer G., General Lattice Theory, $2^{nd}$ edn. Birkh{"a}user Verlag, Basel (1998).
West D. B., Introduction to Graph Theory, Prentice Hall of India, New Delhi (2002).
Kyuno S., An inductive algorithm to construct finite lattices, Math. Comp., textbf{33} (1979), 409--421.
Monteiro L. F., Savini S., and Viglizzo I., Hasse diagrams of posets with up to $7$ elements, and the number of posets with $10$ elements, without the use of computer programs, (2021), arXiv:1710.10343v3