arXivDaily arXiv每日学术速递 周一至周五更新
稍安勿躁,官方尚未更新
arXiv 0907.2595math.CO
收藏

分次偏序集与序数和及离散超盒的自然连接构造

Natural join construction of graded posets versus ordinal sum and discrete hyper boxes

A. K. Kwasniewski

摘要:

本文介绍了分次偏序集$< P,\leq_P >$和$< Q,\leq_Q >$的自然连接$P \os Q$,其中相应的最大和最小集是相同的,表示为序数和$P\oplus Q$,并由此得到蛛网偏序集的$M{ö}bius $函数公式的一个简单证明.我们还引用了其他作者在作者早期作品中给出的具有有限极小元素集的任何分次偏序集的zeta矩阵及其逆的显式公式。这些公式是基于蛛网偏序集的公式和它们的$Hasse$图或称为$KoDAGs$的图,它们被解释为通过自然连接操作连接的二元完全或泛关系链。因此,两个独立集合的自然并是这些平凡有序偏序集的序数和,这些偏序集也由名为dibiclique的有向二团表示,相应地由名为$KoDAGs$的$Hasse $图或图表示。这种蛛网偏序集和等价的Hasse图或图$KoDAGs$也是用离散超盒编码的,这种离散超盒的自然连接运算就是它们的卡积和公共面外的投影.所有在$Hasse$图中没有哑点的分次偏序集(即没有点的入度或出度等于零)都是关系链的自然并,同时可以解释为$n-ary$关系,即$n \in N \cup \{\infty \}$ .

英文摘要:

One introduces here the natural join $P \os Q$ of graded posets $< P,\leq_P >$ and $< Q,\leq_Q >$ with correspondingly maximal and minimal sets being identical as expressed by ordinal sum $P\oplus Q$ apart from other definition and due to that one arrives at a simple proof of the $M{ö}bius $ function formula for cobweb posets. We also quote the other authors explicit formulas for the zeta matrix and its inverse for any graded posets with the finite set of minimal elements from earlier works of the author. These formulas are based on the formulas for cobweb posets and their $Hasse$ diagrams or graphs named $KoDAGs$ which are interpreted as chains of binary complete or universal relations joined by the natural join operation. Natural join of two independent sets is therefore the ordinal sum of this trivially ordered posets represented also by directed biclique named dibiclique and correspondingly by their $Hasse $ diagrams or graphs named $KoDAGs$. Such cobweb posets and equivalently their Hasse diagrams or graphs named $KoDAGs$ are also encoded by discrete hyper-boxes and the natural join operation of such discrete hyper boxes is just cartesian product of them accompanied with projection out of common faces. All graded posets with no mute vertices in their $Hasse$ diagrams which means that no vertex has indegree or outdegree equal zero are natural join of chain of relations and may be at the same time interpreted an $n-ary$ relation, $n \in N \cup \{\infty \}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑