Algebraic games—playing with groups and rings

@article{Brandenburg2018AlgebraicGW,
  title={Algebraic games—playing with groups and rings},
  author={Martin Brandenburg},
  journal={International Journal of Game Theory},
  year={2018},
  volume={47},
  pages={417-450}
}
Two players alternate moves in the following impartial combinatorial game: Given a finitely generated abelian group A, a move consists of picking some $$0 \ne a \in A$$0≠a∈A. The game then continues with the quotient group $$A/\langle a \rangle $$A/⟨a⟩. We prove that under the normal play rule, the second player has a winning strategy if and only if A is a square, i.e. $$A \cong B \times B$$A≅B×B for some abelian group B. Under the misère play rule, only minor modifications concerning… 
Two impartial games on finite p-groups
TLDR
The simplified structure diagrams and nim-values of these two games for finite non-abelian p-groups, dicyclic type groups, and groups of the form ℂ3 ×ℂp has been determined.
Impartial achievement and avoidance games for generating finite groups
TLDR
The 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.
Impartial achievement games for generating generalized dihedral groups
TLDR
The nim-numbers of this game for generalized dihedral groups, which are of the form $\operatorname{Dih}(A)= \mathbb{Z}_2 \ltimes A$ for a finite abelian group $A$, are determined.
Impartial achievement games for generating nilpotent groups
Abstract We study an impartial game introduced by Anderson and Harary. The game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who
Element-Building Games onZn
Weconsider a pair of gameswhere two players alternately select previously unselected elements ofZn given a particular starting element. On each turn, the player either adds or multiplies the element
Element-Building Games on $$\mathbb {Z}_n$$

References

SHOWING 1-10 OF 18 REFERENCES
Achievement and avoidance games for generating abelian groups
For any finite groupG, the DO GENERATE game is played by two players Alpha and Beta as follows. Alpha moves first and choosesx1 ∈G. Thek-th play consists of a choice ofxk ∈G −Sk−1
Torsion generators for all abelian groups
Impartial avoidance games for generating finite groups
We study an impartial avoidance game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group. The first player who
Classification of Finite Rings of Order p2
Most treatments of elementary abstract algebra include a discussion of finite groups and some work on their classification. However, very little is done with finite rings. For example most beginning
Winning Ways for Your Mathematical Plays
In the quarter of a century since three mathematicians and game theorists collaborated to create Winning Ways for Your Mathematical Plays, the book has become the definitive work on the subject of
Lessons in Play: An Introduction to Combinatorial Game Theory
TLDR
Classic techniques are introduced and applied in novel ways to analyze both old and new games, several appearing for the first time in this book.
The Groups of Order Sixteen Made Easy
  • M. Wild
  • Mathematics
    Am. Math. Mon.
  • 2005
TLDR
In this article no Sylow-theory, no theory of p-groups, no relatively free groups (generators and relations), no group actions, not even the structure of finite Abelian groups will be invoked.
Generating Symmetric Groups
[D] L. E. Dickson, History of the Theory of Numbers, vol. 1, 1919, (Chelsea reprint, New York 1971). [L1] E. Lucas, Sur les rapports qui existent entre la theorie des nombres et le calcul integral.
Combinatorial Game Theory
Table of Contents: Combinatorial games Short games The structure of G Impartial games Misere play Loopy games Temperature theory Transfinite games Open problems Mathematical prerequisites A finite
A Millennium Project: Constructing Small Groups
TLDR
Motivated by the millennium, these methods are used to construct the groups of order at most 2000; this calculation is reported on and the resulting group library is described.
...
1
2
...