Relator Games on Groups

Abstract: We define two impartial games, the Relator Achievement Game

e x t t t R E L

and the Relator Avoidance Game

e x t t t R A V

. Given a finite group

G

and generating set

S

, both games begin with the empty word. Two players form a word in

S

by alternately appending an element from

S c u p S^{- 1}

at each turn. The first player to form a word equivalent in

G

to a previous word wins the game

e x t t t R E L

but loses the game

e x t t t R A V

. Alternatively, one can think of

e x t t t R E L

and

e x t t t R A V

as make a cycle and avoid a cycle games on the Cayley graph

G a m m a (G, S)

. We determine winning strategies for several families of finite groups including dihedral, dicyclic, and products of cyclic groups.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Relator Games on Groups