Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice

From MaRDI portal
Publication:722587

DOI10.1007/S11083-017-9431-6zbMATH Open1469.91017arXiv1702.03018OpenAlexW3103858337WikidataQ122963322 ScholiaQ122963322MaRDI QIDQ722587FDOQ722587


Authors: Andries E. Brouwer, J. Daniel Christensen Edit this on Wikidata


Publication date: 27 July 2018

Published in: Order (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1702.03018




Recommendations




Cites Work


Cited In (5)

Uses Software





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)