Subgroup and Submonoid Membership in the lampshuffler of
Abstract: The lampshuffler group of is the semidirect product , which consists of all permutations of that act as a translation outside a finite set. This infinite permutation group naturally contains as subgroups the wreath products for every finite group . We prove that the Subgroup Membership Problem, and more generally, the Submonoid Membership Problem, are decidable in . Our proof reduces Subgroup and Submonoid Membership in to Subgroup Membership in the wreath products , which was shown to be decidable by Lohrey, Steinberg and Zetzsche (2015).
Paper Prompts
Sign up for free to create and run prompts on this paper.