Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.03830 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914304511442944 |
|---|---|
| author | Lu, Jiaping |
| author_facet | Lu, Jiaping |
| contents | Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators required for each wreath product in this sequence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_03830 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generation of Iterated Wreath Products Constructed from Almost Simple Groups Lu, Jiaping Group Theory Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators required for each wreath product in this sequence. |
| title | Generation of Iterated Wreath Products Constructed from Almost Simple Groups |
| topic | Group Theory |
| url | https://arxiv.org/abs/2602.03830 |