2000 character limit reached
Minimal generating sets in wreath products
Published 29 Sep 2012 in math.GR | (1210.0150v1)
Abstract: We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all finite-state automorphisms of such a tree satisfy these conditions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.