We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear extensions of the lattice of a 7-cube and related lattices.
翻译:我们开发了高效计算重现定义的姿势函数的算法。 我们通过反驳对游戏子子子集离(在超立方体上的跳跃)的猜测和计算一个7立方体和相关拉托板的线性扩展数来说明这一算法。