Papers
Topics
Authors
Recent
Search
2000 character limit reached

Enumeration of lattices of nullity kk and containing rr comparable reducible elements

Published 10 Feb 2025 in math.CO | (2502.06912v1)

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 n≥4n \geq 4 elements, having nullity k≥1k \geq 1, and containing 2≤r≤2k2 \leq r \leq 2k reducible elements. Secondly we enumerate all non-isomorphic RC-lattices on n≥4n \geq 4 elements, having nullity k≥1k \geq 1. This work is in respect of Birkhoff's open problem of enumerating all finite lattices on nn elements.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.