论文标题
一种灵活的方法，用于枚举下盘及其在Dedekind编号上的应用
A Flexible Approach for the Enumeration of Down-Sets and its Application on Dedekind Numbers
论文作者
论文摘要
我们引入了一种灵活的方法，用于枚举有限poset的下集，并通过计算Dedekind数字$ b（5）= 7581 $和$ b（6）= 7828354 $进行测试。对于$ b（5）$的计算，我们开发了两种方法，其中第一种方法（没有预先计算）需要对80个POSET的简单评估，第二个POSET（预计预定率）为34个POSET。通过评估245个POSET来完成$ b（6）$（带有预表现）的计算。
We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers $b(5) = 7581$ and $b(6) = 7828354$. For the calculation of $b(5)$, we develop two methods of which the first one (without pre-calculations) requires simple evaluation of 80 posets and the second one (with pre-calculations) of 34 posets. The calculation of $b(6)$ (with pre-calculations) is done by evaluating 245 posets.
