Palindromes in finite groups and the Explorer-Director game
DOI10.1142/S0218196721500235zbMath1466.91048arXiv1904.00467OpenAlexW3123603144MaRDI QIDQ4994452
Pat Devlin, Dagur Tómas Ásgeirsson
Publication date: 18 June 2021
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.00467
nilpotent groupstwisted subgroupscombinatorial group theorypalindromesexplorer-director gameMagnus-Derek game
2-person games (91A05) Other game-theoretic models (91A40) Nilpotent groups (20F18) Asymptotic properties of groups (20F69) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Unnamed Item
- More on the Magnus-Derek game
- The c game revisited
- An \(O(n)\)-round strategy for the Magnus-Derek game
- On twisted subgroups and Bol loops of odd order.
- The Magnus-Derek game
- On loops of odd order. II
- On loops of odd order
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Near subgroups of finite groups
- Palindromic words in simple groups
This page was built for publication: Palindromes in finite groups and the Explorer-Director game