arXiv Analytics

Sign in

arXiv:1002.0320 [math.GR]AbstractReferencesReviewsResources

Finite generation of iterated wreath products

Ievgen Bondarenko

Published 2010-02-01, updated 2010-07-01Version 2

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].

Comments: 7 pages. An example of a branch group with maximal subgroups of infinite index is added
Categories: math.GR
Subjects: 20F05, 20E22, 20E18, 20E08
Related articles: Most relevant | Search more
arXiv:2501.17524 [math.GR] (Published 2025-01-29)
Generation of iterated wreath products constructed from alternating, symmetric and cyclic groups
arXiv:1506.00139 [math.GR] (Published 2015-05-30)
On hereditarily just infinite profinite groups obtained via iterated wreath products
arXiv:1506.00143 [math.GR] (Published 2015-05-30)
Finite generation of iterated wreath products in product action