Generation of Iterated Wreath Products Constructed from Almost Simple Groups
Authors: Jiaping LuPublished: Feb 3, 2026
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.
Growth and citations
No state
This paper is currently showing No growth state computed yet..
No citation data yet.Citation metrics will appear here once available.
Citation metrics and growth state from academic sources (e.g. Semantic Scholar). See About for details.
Cited by (0)
No citing papers yet
Papers that cite this one will appear here once data is available.
View citations page →References (0)
No references in DB yet
References for this paper will appear here once ingested.
Related papers in Group Theory
- On a conjecture of Peter Neumann on fixed points in permutation groups0 citations
- Stability of the weak Haagerup property under graph products0 citations
- Permutation groups and symmetric Hecke algebras0 citations
Growth transitions
No transitions recorded yet
Growth state transitions will appear here once computed.