Palindromes in finite groups and the Explorer-Director game
Research output: Contribution to journal › Journal article › Research › peer-review
In this paper, we use the notion of twisted subgroups (i.e. subsets of group elements closed under the binary operation (a,b) aba) to provide the first structural characterization of optimal play in the Explorer-Director game, introduced as the Magnus-Derek game by Nedev and Muthukrishnan and generalized to finite groups by Gerbner. In particular, we reduce the game to the problem of finding the largest proper twisted subgroup, and as a corollary we resolve the Explorer-Director game completely for all nilpotent groups.
Original language | English |
---|---|
Journal | International Journal of Algebra and Computation |
Volume | 31 |
Issue number | 3 |
Pages (from-to) | 491-499 |
Number of pages | 9 |
ISSN | 0218-1967 |
DOIs | |
Publication status | Published - 2021 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:
© 2021 World Scientific Publishing Company.
- combinatorial group theory, Explorer-Director game, Magnus-Derek game, nilpotent groups, palindromes, twisted subgroups
Research areas
ID: 290532713