Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice

  title={Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice},
  author={Andries E. Brouwer and J. Daniel Christensen},
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. 
Chomp on generalized Kneser graphs and others
Questions about which player has a winning strategy for a given graph are answered and the Nim-value is determined for the class of generalized Kneser graphs and for several families of Johnson graphs.
A vertex and edge deletion game on graphs
A conjecture of Khandhawit and Ye on the nim-values of graphs with one odd cycle is proved and it is seen that this game exhibits a surprising amount of unexplained regularity.
De Finetti Lattices and Magog Triangles
The proof techniques are adopted to show that row reversal of an alternating sign matrix corresponds to a natural involution on gog triangles, and therefore is equinumerous with alternating sign matrices.


Counting linear extensions
We survey the problem of counting the number of linear extensions of a partially ordered set. We show that this problem is #P-complete, settling a long-standing open question. This result is
David Gale's subset take-away game
In this department the MONTHLYpresents easily stated unsolved problems dealing with notions ordinarily encountered in undergraduate mathematics. Each problem should be accompanied by relevant
A computation of the eighth Dedekind number
We compute the eighth Dedekind number, or the number of monotone collections of subsets of a set with eight elements. The number obtained is 56, 130, 437, 228, 687, 557, 907, 788.
Algorithms for Symbolic Computation and their Applications - Standard Bases over Rings and Rank Tests in Statistics
The theory of standard bases in free modules over (localized) polynomial rings is developed and an algorithm to compute standard bases with respect to arbitrary (module) monomial orderings is introduced.
The Number of Linear Extensions of the Boolean Lattice
The entropy method of Kahn is used to show that the exact maximum number of linear extensions of a d-regular bipartite order on n elements, in the case when n is a multiple of 2d.
On numbers and games
  • R. Guy
  • Mathematics
    Proceedings of the IEEE
  • 1978
The motivation for ONAG may have been, and perhaps was-and I would like to think that it was-the attempt to bridge the theory gap between nim-like and chess-like games.
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.
The Rank Ordering of Genotypic Fitness Values Predicts Genetic Constraint on Natural Selection on Landscapes Lacking Sign Epistasis
A novel formalism is presented that more finely partitions the universe of possible fitness landscapes on the basis of the rank ordering of their genotypic fitness values and finds that a highly statistically significant effect exists between landscape membership in fitness rank-ordering partition and two different proxies for genetic constraint, even within this subset of landscapes.
Geometry of conditional independence
Geometry of conditional independence
Nim-type games