Finite generation of iterated wreath products in product action
Matteo Vannacci

TL;DR
This paper proves that certain infinitely iterated wreath products of finite perfect transitive groups are topologically finitely generated under specific conditions, with explicit generators provided for particular cases.
Contribution
It establishes finite generation of iterated wreath products in product action for non-regular groups and provides explicit generators for special sequences.
Findings
Infinitely iterated wreath products are topologically finitely generated.
The bounds on generators have correct asymptotic behavior.
Explicit generators are constructed for specific sequences.
Abstract
Let be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in is topologically finitely generated, provided that the actions of the groups in are not regular. We prove that our bound has the right asymptotic behaviour. We also deduce that other infinitely iterated mixed wreath products of groups in are finitely generated. Finally we apply our methods to find explicitly two generators of infinitely iterated wreath products in product action of special sequences .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · semigroups and automata theory · Rings, Modules, and Algebras
