Impartial achievement and avoidance games for generating finite groups

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a generating set from the jointly selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. After the development of some general results, we determine the nim-numbers of these games for abelian and dihedral groups. We also present some conjectures based on computer calculations. Our main computational and theoretical tool is the structure diagram of a game, which is a type of identification digraph of the game digraph that is compatible with the nim-numbers of the positions. Structure diagrams also provide simple yet intuitive visualizations of these games that capture the complexity of the positions.

Original languageEnglish (US)
Pages (from-to)1-34
Number of pages34
JournalInternational Journal of Game Theory
DOIs
StateAccepted/In press - Dec 7 2017

Fingerprint

Finite Group
Game
visualization
Group
Nim
Generating Set
Digraph
Diagram
Dihedral group
Avoidance
Abelian group
Intuitive
Visualization

Keywords

  • Impartial game
  • Maximal subgroup
  • Structure diagram

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics (miscellaneous)
  • Social Sciences (miscellaneous)
  • Economics and Econometrics
  • Statistics, Probability and Uncertainty

Cite this

@article{fb921b95919f499a8ba4f48b59bf918e,
title = "Impartial achievement and avoidance games for generating finite groups",
abstract = "We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a generating set from the jointly selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. After the development of some general results, we determine the nim-numbers of these games for abelian and dihedral groups. We also present some conjectures based on computer calculations. Our main computational and theoretical tool is the structure diagram of a game, which is a type of identification digraph of the game digraph that is compatible with the nim-numbers of the positions. Structure diagrams also provide simple yet intuitive visualizations of these games that capture the complexity of the positions.",
keywords = "Impartial game, Maximal subgroup, Structure diagram",
author = "Ernst, {Dana C} and Nandor Sieben",
year = "2017",
month = "12",
day = "7",
doi = "10.1007/s00182-017-0602-x",
language = "English (US)",
pages = "1--34",
journal = "International Journal of Game Theory",
issn = "0020-7276",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Impartial achievement and avoidance games for generating finite groups

AU - Ernst, Dana C

AU - Sieben, Nandor

PY - 2017/12/7

Y1 - 2017/12/7

N2 - We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a generating set from the jointly selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. After the development of some general results, we determine the nim-numbers of these games for abelian and dihedral groups. We also present some conjectures based on computer calculations. Our main computational and theoretical tool is the structure diagram of a game, which is a type of identification digraph of the game digraph that is compatible with the nim-numbers of the positions. Structure diagrams also provide simple yet intuitive visualizations of these games that capture the complexity of the positions.

AB - We study two impartial games introduced by Anderson and Harary and further developed by Barnes. Both games are played by two players who alternately select previously unselected elements of a finite group. The first player who builds a generating set from the jointly selected elements wins the first game. The first player who cannot select an element without building a generating set loses the second game. After the development of some general results, we determine the nim-numbers of these games for abelian and dihedral groups. We also present some conjectures based on computer calculations. Our main computational and theoretical tool is the structure diagram of a game, which is a type of identification digraph of the game digraph that is compatible with the nim-numbers of the positions. Structure diagrams also provide simple yet intuitive visualizations of these games that capture the complexity of the positions.

KW - Impartial game

KW - Maximal subgroup

KW - Structure diagram

UR - http://www.scopus.com/inward/record.url?scp=85037348892&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85037348892&partnerID=8YFLogxK

U2 - 10.1007/s00182-017-0602-x

DO - 10.1007/s00182-017-0602-x

M3 - Article

SP - 1

EP - 34

JO - International Journal of Game Theory

JF - International Journal of Game Theory

SN - 0020-7276

ER -