IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v50y2021i3d10.1007_s00182-020-00715-3.html
   My bibliography  Save this article

On lattices from combinatorial game theory: infinite case

Author

Listed:
  • Alda Carvalho

    (University of Lisbon
    University of Lisbon)

  • Carlos P. Santos

    (University of Lisbon
    Linear Structures and Applications University of Lisbon)

  • Cátia Dias

    (ISEL)

  • Francisco Coelho

    (University of Evora & LabMAg)

  • João P. Neto

    (University of Evora & LabMAg)

  • Richard J. Nowakowski

    (Dalhousie University)

  • Sandra Vinagre

    (University of Evora, CIMA)

Abstract

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 fixed ordinal is a distributive lattice and also that the children of any set of games form a complete lattice. We are interested in the converse. In a previous paper, we showed that for any finite lattice there exists a finite set of games such that the partial order of the children, 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 infinite 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.

Suggested Citation

  • Alda Carvalho & Carlos P. Santos & Cátia Dias & Francisco Coelho & João P. Neto & Richard J. Nowakowski & Sandra Vinagre, 2021. "On lattices from combinatorial game theory: infinite case," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(3), pages 655-670, September.
  • Handle: RePEc:spr:jogath:v:50:y:2021:i:3:d:10.1007_s00182-020-00715-3
    DOI: 10.1007/s00182-020-00715-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-020-00715-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00182-020-00715-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:50:y:2021:i:3:d:10.1007_s00182-020-00715-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.