2000 character limit reached
Enumeration of lattices of nullity and containing comparable reducible elements
Published 10 Feb 2025 in math.CO | (2502.06912v1)
Abstract: In 2002 Thakare et al.\ counted non-isomorphic lattices on 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 elements. For this purpose, firstly we enumerate all non-isomorphic RC-lattices on elements, having nullity , and containing reducible elements. Secondly we enumerate all non-isomorphic RC-lattices on elements, having nullity . This work is in respect of Birkhoff's open problem of enumerating all finite lattices on elements.
Paper Prompts
Sign up for free to create and run prompts on this paper.