Generation of generalised wreath products of symmetric groups
Let I be a finite partially ordered set and let (Sym(Δ i ),Δ i ) i be a sequence of symmetric groups indexed by I. We study the generalised wreath product on this sequence of permutation groups and determine the minimum number of generators required for this generalised wreath product.
Authors
- Jiaping Lu (ORCID: https://orcid.org/0009-0009-2102-5278)
Publication Details
- Journal
- International Journal of Algebra and Computation
- Published
- 2026-11-13
- DOI
- https://doi.org/10.1142/s0218196726500748
- Primary Topic
- Finite Group Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00