Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Jiaping Lu (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: