Heap games, numeration systems and sequences

Simple item page
dc.creatorFraenkel, Aviezri S.
dc.date1998-09-14
dc.date.accessioned2026-07-07T05:26:00Z
dc.date.available2026-07-07T05:26:00Z
dc.descriptionWe propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used, which enables us to decide whether the family has an efficient strategy or not. We introduce yet another class of sequences, and demonstrate its equivalence with the class of sequences defined for the strategy of our games.
dc.descriptionTo appear in Annals of Combinatorics
dc.identifierhttps://arxiv.org/abs/math/9809074
dc.identifierhttp://arxiv.org/abs/math/9809074
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77396
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.titleHeap games, numeration systems and sequences
dc.typetext

Files

Collections

arXiv