Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice
classification
🧮 math.CO
cs.GT
keywords
algorithmcomputingconjecturesextensionslatticelinearsubsettakeaway
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.