Misere quotients for impartial games

Simple item page
dc.creatorPlambeck, Thane E.
dc.creatorSiegel, Aaron N.
dc.date2006-09-28
dc.date2007-08-14
dc.date.accessioned2026-07-07T09:47:15Z
dc.date.available2026-07-07T09:47:15Z
dc.descriptionWe announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also introduce several advances in the structure theory of misere quotients, including a connection between the combinatorial structure of normal and misere play.
dc.descriptionPaper has been split into two parts: this part, and a supplement at arXiv:0705.2404v1
dc.identifierhttps://arxiv.org/abs/math/0609825
dc.identifierhttp://arxiv.org/abs/math/0609825
dc.identifierJournal of Combinatorial Theory, Series A (May 2008) pp 593-622
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163808
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject91A46; 20M14
dc.titleMisere quotients for impartial games
dc.typetext

Files

Collections

arXiv