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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Generation of generalised wreath products of symmetric groups

Jiaping Lu
3 links
International Journal of Algebra and Computation
Finite Group Theory Research
article

Generation of generalised wreath products of symmetric groups

Jiaping Lu
article en

Abstract

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.

International Journal of Algebra and Computation
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon