Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice
| Autor: | J. Daniel Christensen, Andries E. Brouwer |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
FOS: Computer and information sciences Algebra and Number Theory Chomp High Energy Physics::Lattice 91A46 06A07 Computational Theory and Mathematics Computer Science - Computer Science and Game Theory Lattice (order) FOS: Mathematics Mathematics - Combinatorics Geometry and Topology Hypercube Combinatorics (math.CO) Counterexample Mathematics MathematicsofComputing_DISCRETEMATHEMATICS Computer Science and Game Theory (cs.GT) |
| DOI: | 10.48550/arxiv.1702.03018 |
| Popis: | 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. Comment: 5 pages. v2 has improvements throughout and is to appear in Order |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|