Generation of Generalised Wreath Products of Symmetric Groups
Group Theory
2026-04-20 v1
Abstract
Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the minimum number d(F) of generators required for this generalised wreath product.
Keywords
Cite
@article{arxiv.2604.16141,
title = {Generation of Generalised Wreath Products of Symmetric Groups},
author = {Jiaping Lu},
journal= {arXiv preprint arXiv:2604.16141},
year = {2026}
}
Comments
All comments are welcome!