Counting of lattices containing up to 4 reducible elements and having nullity up to 3
Abstract
In this paper, we count all non-isomorphic lattices on n elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on n elements.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.