Generation of Iterated Wreath Products Constructed from Almost Simple Groups
Group Theory
2026-02-04 v1
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.
Cite
@article{arxiv.2602.03830,
title = {Generation of Iterated Wreath Products Constructed from Almost Simple Groups},
author = {Jiaping Lu},
journal= {arXiv preprint arXiv:2602.03830},
year = {2026}
}