T1分离公理下Davis子集格、原子格与闭包系统的密码同构
On the Cryptomorphism between Davis' Subset Lattices, Atomic Lattices, and Closure Systems under T1 Separation Axiom
摘要:
在本文中,我们计数集封闭系统(也称为摩尔家庭)的情况下,所有的单元素集是封闭的。特别地,我们给出了大小为$n=6$的基集的严格族(包括空集)和非严格族的数目。我们还提供了这样的不等价的摩尔家庭的数量相对于所有排列的基础设置为$n=6$。在OEIS和现有文献中的检索显示,发现的数字与D的条目一致。M.~ Davis的集合并格(\seqnum{A235604},直到$n=5$)和$|\mathcal L_n|$,$n$原子上的原子格数,由S.地图(最多$n=6$)。因此,我们研究所有这些情况下,建立一对一的对应关系,它们之间通过伽罗瓦推理和形式概念分析,并提供给读者我们的两个枚举算法,以及这些算法的结果用于额外的测试。其他结果包括$n=6$的最大无交族尺寸加上我们对$n=7$的猜想,原子格数的上界$\mathcal L_n$,以及基于极格理论的$\mathcal L_n$的一些结构性质.
英文摘要:
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 $|\mathcal L_n|$, 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 $\mathcal L_n$, and some structural properties of $\mathcal L_n$ based on the theory of extremal lattices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。