Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
From MaRDI portal
(Redirected from Publication:722587)
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.
Recommendations
Cites work
Cited in
(5)
This page was built for publication: Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722587)