On lattices from combinatorial game theory: infinite case
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Outros Autores: | , , , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.21/14830 |
Resumo: | 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. |
id |
RCAP_59618e3a778042c664d29dcbbf7a9ce5 |
---|---|
oai_identifier_str |
oai:repositorio.ipl.pt:10400.21/14830 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
On lattices from combinatorial game theory: infinite caseCombinatorial game theoryLatticesRepresentation theoremsGiven 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.SpringerRCIPLCarvalho, AldaSantos, CarlosDias, CátiaCoelho, FranciscoNeto, João P.Nowakowski, RichardVinagre, Sandra2022-07-13T11:17:56Z2020-03-122020-03-12T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.21/14830engCARVALHO, 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.1432-127010.1007/s00182-020-00715-3metadata only accessinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-08-03T10:11:31Zoai:repositorio.ipl.pt:10400.21/14830Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:22:33.897566Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
On lattices from combinatorial game theory: infinite case |
title |
On lattices from combinatorial game theory: infinite case |
spellingShingle |
On lattices from combinatorial game theory: infinite case Carvalho, Alda Combinatorial game theory Lattices Representation theorems |
title_short |
On lattices from combinatorial game theory: infinite case |
title_full |
On lattices from combinatorial game theory: infinite case |
title_fullStr |
On lattices from combinatorial game theory: infinite case |
title_full_unstemmed |
On lattices from combinatorial game theory: infinite case |
title_sort |
On lattices from combinatorial game theory: infinite case |
author |
Carvalho, Alda |
author_facet |
Carvalho, Alda Santos, Carlos Dias, Cátia Coelho, Francisco Neto, João P. Nowakowski, Richard Vinagre, Sandra |
author_role |
author |
author2 |
Santos, Carlos Dias, Cátia Coelho, Francisco Neto, João P. Nowakowski, Richard Vinagre, Sandra |
author2_role |
author author author author author author |
dc.contributor.none.fl_str_mv |
RCIPL |
dc.contributor.author.fl_str_mv |
Carvalho, Alda Santos, Carlos Dias, Cátia Coelho, Francisco Neto, João P. Nowakowski, Richard Vinagre, Sandra |
dc.subject.por.fl_str_mv |
Combinatorial game theory Lattices Representation theorems |
topic |
Combinatorial game theory Lattices Representation theorems |
description |
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. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-03-12 2020-03-12T00:00:00Z 2022-07-13T11:17:56Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.21/14830 |
url |
http://hdl.handle.net/10400.21/14830 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
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. 1432-1270 10.1007/s00182-020-00715-3 |
dc.rights.driver.fl_str_mv |
metadata only access info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
metadata only access |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799133497598672896 |