Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.13519 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912279561240576 |
|---|---|
| author | Aware, B. P. Bhavale, A. N. |
| author_facet | Aware, B. P. Bhavale, A. N. |
| contents | In 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. In 2003 Pawar and Waphare counted all non-isomorphic lattices on n elements and n edges, which are precisely lattices of nullity one. In 2002 Thakare et al. counted all non-isomorphic lattices on n elements containing two reducible elements. In the same paper, Thakare et al. counted lattices on n elements containing up to n+1 edges, which are precisely lattices of nullity up to two. In 2024 Bhavale and Aware counted all non-isomorphic lattices on n elements, containing up to three reducible elements. Recently, Aware and Bhavale counted all non-isomorphic lattices on n elements, containing four comparable reducible elements, and having nullity three. In this paper, we count up to isomorphism the class of all lattices on n elements containing five comparable reducible elements, and having nullity three. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_13519 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Counting of lattices containing up to five comparable reducible elements and having nullity up to three Aware, B. P. Bhavale, A. N. Combinatorics In 2020 Bhavale and Waphare introduced the concept of a nullity of a poset as nullity of its cover graph. In 2003 Pawar and Waphare counted all non-isomorphic lattices on n elements and n edges, which are precisely lattices of nullity one. In 2002 Thakare et al. counted all non-isomorphic lattices on n elements containing two reducible elements. In the same paper, Thakare et al. counted lattices on n elements containing up to n+1 edges, which are precisely lattices of nullity up to two. In 2024 Bhavale and Aware counted all non-isomorphic lattices on n elements, containing up to three reducible elements. Recently, Aware and Bhavale counted all non-isomorphic lattices on n elements, containing four comparable reducible elements, and having nullity three. In this paper, we count up to isomorphism the class of all lattices on n elements containing five comparable reducible elements, and having nullity three. |
| title | Counting of lattices containing up to five comparable reducible elements and having nullity up to three |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.13519 |