English

Enumeration of lattices of nullity $k$ and containing $r$ comparable reducible elements

Combinatorics 2025-02-12 v1

Abstract

In 2002 Thakare et al.\ counted non-isomorphic lattices on nn elements, having nullity up to two. In 2020 Bhavale and Waphare introduced the concept of RC-lattices as the class of all lattices in which all the reducible elements are comparable. In this paper, we enumerate all non-isomorphic RC-lattices on nn elements. For this purpose, firstly we enumerate all non-isomorphic RC-lattices on n4n \geq 4 elements, having nullity k1k \geq 1, and containing 2r2k2 \leq r \leq 2k reducible elements. Secondly we enumerate all non-isomorphic RC-lattices on n4n \geq 4 elements, having nullity k1k \geq 1. This work is in respect of Birkhoff's open problem of enumerating all finite lattices on nn elements.

Keywords

Cite

@article{arxiv.2502.06912,
  title  = {Enumeration of lattices of nullity $k$ and containing $r$ comparable reducible elements},
  author = {A. N. Bhavale},
  journal= {arXiv preprint arXiv:2502.06912},
  year   = {2025}
}

Comments

11 pages. arXiv admin note: substantial text overlap with arXiv:2407.06736