Keywords:-
Article Content:-
Abstract
In 2020, Bhavale and Waphare introduced the concepts of fundamental basic block and basic block. Further, Bhavale and Waphare 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. With the help of those formulae, Bhavale et al. obtained the Hasse diagrams of all non-isomorphic basic blocks containing up to four comparable reducible elements and having nullity up to five. In this paper, we actually obtain the Hasse diagrams of the basic blocks containing four comparable reducible elements and having nullity six.
References:-
References
Bhavale A. N. and Aware B. P., Counting of lattices having nullity up to two. Journal of Combinatorial Mathematics and Combinatorial Computing 126 (2024), 215-223. https://doi.org/10.61091/jcmcc126-14
Bhavale A. N. and Aware B. P., Counting of lattices on up to three reducible elements. Journal of the Indian Mathematical Society. 92(3) (2025), 512529. 10.18311/jims/2025/36377.
Bhavale A. N. and Aware B. P., Counting of lattices containing up to four comparable reducible elements and having nullity up to three, Journal of Combinatorial Mathematics and Combinatorial Computing. arXiv:2412.03627v2 (Accepted on 29/08/2025)
Bhavale A. N., Mundekar S., Kule P. and Shete K., Hasse diagrams of basic blocks containing four comparable reducible elements and having nullity five. Int. J. Math. And Appl.,13(2)(2025), 27–34. https://ijmaa.in/index.php/ijmaa/article/view/1552/1476
Bhavale A. N., Parate P., Tupte P. and Shirsath S., Hasse diagrams of basic blocks containing four comparable reducible elements and having nullity four. International Journal of Mathematics and Computer Research, 13 (2025), 5099-5106. 10.47191/ijmcr/v13i4.12.
Bhavale A. N. and Waphare B. N., Basic retracts and counting of lattices, Australas. J. Combin., 78(1)(2020), 73-99.
Birkhoff G., Lattice theory Vol. 25., Amer. Math. Soc. Colloq., New Delhi (1979).
Brinkmann G., and McKay, B. D., Posets on up to 16 points, Order,
19(2002), 147-179.
Gratzer G., General Lattice Theory, Birkhauser Verlag, Basel (1998).
Heitzig J., and Reinhold, J., Counting finite lattices, Algebra Universalis, 48(1)(2002), 43-53.
Kolhe D. N., Hasse diagrams, Characterizations of modularity and distributivity in semi-lattices and related results, M. Phil. Dissertation, University of Pune, Pune (1989).
Kyuno S., An inductive algorithm to construct finite lattices, Math. Comp., 33 (1979), 409-421. https://www.ams.org/journals/mcom/1979-33145/S0025-5718-1979-0514837-9/S0025-5718-1979-0514837-9.pdf
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
Rival I., Lattices with doubly irreducible elements, Canad. Math. Bull., (17)(1974) 91-95.
West D. B., Introduction to Graph Theory, Prentice Hall of India, New Delhi (2002).