Generation of Iterated Wreath Products Constructed from Almost Simple Groups

2026/02/28 by Jiaping Lu
Mathematics · #math.GR

paper · pdf

Abstract

Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators required for each wreath product in this sequence.

Citations

• Generation of iterated wreath products constructed from alternating, symmetric and cyclic groups
• Finite generation of iterated wreath products

Related

• Generation of iterated wreath products constructed from alternating, symmetric and cyclic groups
• Minimal generating sets in wreath products
• Generating wreath products of symmetric and alternating groups
• On generation problems in generalised Wilson type groups
• Characterization of finitely generated infinitely iterated wreath products