Papers › On the Cryptomorphism between Davis' Subset Lattices, Atomic Lattices, and Closure...
On the Cryptomorphism between Davis' Subset Lattices, Atomic Lattices, and Closure Systems under T1 Separation Axiom
Dmitry I. Ignatov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we count set closure systems (also known as Moore families) for the case when all single element sets are closed. In particular, we give the numbers of such strict (empty set included) and non-strict families for the base set of size n=6. We also provide the number of such inequivalent Moore families with respect to all permutations of the base set up to n=6. The search in OEIS and existing literature revealed the coincidence of the found numbers with the entry for D.\ M.~Davis' set union lattice (\seqnum{A235604}, up to n=5) and |ℒₙ|, the number of atomic lattices on n atoms, obtained by S.\ Mapes (up to n=6), respectively. Thus we study all those cases, establish one-to-one correspondences between them via Galois adjunctions and Formal Concept Analysis, and provide the reader with two of our enumerative algorithms as well as with the results of these algorithms used for additional tests. Other results include the largest size of intersection free families for n=6 plus our conjecture for n=7, an upper bound for the number of atomic lattices ℒₙ, and some structural properties of ℒₙ based on the theory of extremal lattices.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Datasets
Introduced by this paper, per the archive.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections