Generation of Generalised Wreath Products of Symmetric Groups
Abstract
Let I be a finite partially ordered set and let (Sym(i),i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, ) on this sequence of permutation groups. We determine the minimum number d(F) of generators required for this generalised wreath product.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.