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

DOI10.1016/J.TCS.2014.01.025zbMATH Open1293.91033OpenAlexW2079050722MaRDI QIDQ2437772FDOQ2437772

Sandra Vinagre, Cátia Dias, Alda Carvalho, R. J. Nowakowski, João Pedro Neto, Francisco Coelho, Carlos Pereira dos Santos

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.025

Recommendations

• Lattices of games
• On lattices from combinatorial game theory: infinite case
• The lattice structure of \(n\)-player games
• Lattice point methods for combinatorial games
• Algorithms for lattice games

zbMATH Keywords

latticesmodularitycombinatorial game theoryrepresentation theorems

Mathematics Subject Classification ID

Representation theory of lattices (06B15) Combinatorial games (91A46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattices of games
• The representation of posets and lattices by sets
• Counting the number of games
• Projective geometries as cover-preserving sublattices
• Title not available (Why is that?)

Cited In (3)

• Representation of game algebras
• On lattices from combinatorial game theory: infinite case
• The structure of the distributive lattice of games born by day \(n\)

This page was built for publication: On lattices from combinatorial game theory modularity and a representation theorem: finite case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437772)