pith. sign in

arxiv: 1002.0320 · v2 · submitted 2010-02-01 · 🧮 math.GR

Finite generation of iterated wreath products

classification 🧮 math.GR
keywords finitefinitelygeneratedgroupwreathboundedgeneratorsiterated
0
0 comments X
read the original abstract

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if and only if the profinite abelian group $\prod_{n\geq 1} G_n/G'_n$ is topologically finitely generated. As a corollary, for a finite transitive group $G$ the minimal number of generators of the wreath power $G\wr...\wr G\wr G$ ($n$ times) is bounded if $G$ is perfect, and grows linearly if $G$ is non-perfect. As a by-product we construct a finitely generated branch group, which has maximal subgroups of infinite index, answering [2,Question 14].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.