Repository logo
 
Publication

On lattices from combinatorial game theory modularity and a representation theorem: finite case

dc.contributor.authorCarvalho, Alda
dc.contributor.authorSantos, Carlos Pereira dos
dc.contributor.authorDias, Catia
dc.contributor.authorCoelho, Francisco
dc.contributor.authorNeto, João Pedro
dc.contributor.authorNowakowski, Richard
dc.contributor.authorVinagre, Sandra
dc.date.accessioned2015-08-25T14:34:32Z
dc.date.available2015-08-25T14:34:32Z
dc.date.issued2014-03
dc.description.abstractWe show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.por
dc.identifier.citationCARVALHO, Alda Cristina Jesus V. Nunes de, [et al] – On lattices from combinatorial game theory modularity and a representation theorem: Finite case. Theroretical Computer Science. ISSN: 0304-3975. Vol. 527 (2014), pp. 37-49por
dc.identifier.doi10.1016/j.tcs.2014.01.025
dc.identifier.issn0304-3975
dc.identifier.issn1879-2294
dc.identifier.urihttp://hdl.handle.net/10400.21/5012
dc.language.isoengpor
dc.peerreviewedyespor
dc.publisherElsevier Science BVpor
dc.subjectCombinatorial game theorypor
dc.subjectLatticespor
dc.subjectModularitypor
dc.subjectRepresentation theoremspor
dc.titleOn lattices from combinatorial game theory modularity and a representation theorem: finite casepor
dc.typejournal article
dspace.entity.typePublication
oaire.citation.endPage49por
oaire.citation.startPage37por
oaire.citation.titleTheroretical Computer Sciencepor
oaire.citation.volume527por
person.familyNameCarvalho
person.familyNameDias
person.givenNameAlda
person.givenNameCátia
person.identifier.ciencia-idFD18-CBDD-B7C7
person.identifier.ciencia-id9211-3BB7-E75E
person.identifier.orcid0000-0003-2642-4947
person.identifier.orcid0000-0001-5803-9168
person.identifier.scopus-author-id25027091800
rcaap.rightsclosedAccesspor
rcaap.typearticlepor
relation.isAuthorOfPublication214fa21c-bca0-4769-99b0-5f1239d2ea41
relation.isAuthorOfPublication93f495c6-8633-4b36-b57c-0c2d5b60eb50
relation.isAuthorOfPublication.latestForDiscovery93f495c6-8633-4b36-b57c-0c2d5b60eb50

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ON LATTICES FROM COMBINATORIAL GAME THEORY MODULARITY AND A REPRESENTATION THEOREM_FINITE CASE.pdf
Size:
264.78 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: