| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 2.61 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Given a set of combinatorial games, the children are all those games that can be generated using as options the games of the original set. It is known that the partial order of the children of all games whose birthday is less than a fxed ordinal is a distributive lattice and also that the children of any set of games form a complete lat tice. We are interested in the converse. In a previous paper, we showed that for any fnite lattice there exists a fnite set of games such that the partial order of the chil dren, minus the top and bottom elements, is isomorphic to the original lattice. Here, the main part of the paper is to extend the result to infnite complete lattices. An original motivating question was to characterize those sets whose children generate distributive lattices. While we do not solve it, we show that if the process of taking children is iterated, eventually the corresponding lattice is distributive.
Description
Keywords
Combinatorial game theory Lattices Representation theorems
Citation
CARVALHO, Alda; [et al] – On lattices from combinatorial game theory: infinite case. International Journal of Game Theory. ISSN 1432-1270. Vol. 50, N.º 3 (2021), pp. 655-670.
Publisher
Springer