12 citations · 31 across the 16 of their papers we have counts for
16 papers
The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi
Duane M. Broline, Daniel E. Loeb
Certain endgame considerations in the two-player Nigerian Mancala-type game Ayo can be identified with the problem of finding winning positions in the solitaire game Tchoukaitlon.…
Symmetric chain decompositions of B_n and Pi_n
Erensto Damiani, Ottavio D'Antona, Daniel E. Loeb
We review the Green/Kleitman/Leeb interpretation of de Bruijn's symmetric chain decomposition of , and explain how it can be used to find a maximal collection of disj…
A new proof of Monjardet's median theorem
Daniel E. Loeb
New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tight…
Richman games
Andrew J. Lazarus, Daniel E. Loeb, James G. Propp +1
A Richman game is a combinatorial game in which, rather than alternating moves, the two players bid for the privilege of making the next move. We consider both the case where the p…
Sequences of symmetric functions of binomial type
Daniel E. Loeb
We take advantage of the combinatorial interpretations of many sequences of polynomials of binomial type to define a sequence of symmetric functions corresponding to each sequence…
The iterated logarithmic algebra II: Sheffer sequences
Daniel E. Loeb
An extension of the theory of the Iterated Logarithmic Algebra gives the logarithmic analog of a Sheffer or Appell sequence of polynomials. This leads to several examples including…