Playing Nim on a simplicial complex

Richard Ehrenborg, Einar Steingrímsson

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a simplicial complex and allowing a move to affect the piles on any set of vertices that forms a face of the complex. Under certain conditions on the complex we present a winning strategy. These conditions are satisfied, for instance, when the simplicial complex consists of the independent sets of a binary matroid. Moreover, we study four operations on a simplicial complex under which games on the complex behave nicely. We also consider particular complexes that correspond to natural generalizations of classical Nim.

Original languageEnglish
Article numberR9
Pages (from-to)1-33
Number of pages33
JournalElectronic Journal of Combinatorics
Volume3
Issue number1 R
DOIs
StatePublished - 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Playing Nim on a simplicial complex'. Together they form a unique fingerprint.

Cite this