We point out that the optimal pebbling number of the n-cube is (4),+o~log,), and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way. (~)â€¦ (More)

Suppose that P is a (not necessarily convex) polytope in I~ n that can fill ~n with congruent copies of itself. Then, except for its volume, all its classical Dehn invariants for Euclidean scissorsâ€¦ (More)

Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2,. .. , n with cards in randomly chosen positions. We show that for n â‰¥ 18, the identity permutation is theâ€¦ (More)

Moews, D., Sums of games born on Days 2 and 3, Theoretical Computer Science 91(1991) 119-128. We compute some groups connected with finite partizan combinatorial games whose game-trees have height atâ€¦ (More)

We compute the abstract group structure of the group Ug of partizan games and the group ShUg of short partizan games. We also determine which partially ordered cyclic groups are subgroups of Ug andâ€¦ (More)