Covering certain Wreath Products with Proper Subgroups
Martino Garonzi, Attila Maroti

TL;DR
This paper investigates the minimal number of proper subgroups needed to cover certain wreath products involving nonabelian finite simple groups and cyclic groups, providing formulas and estimates.
Contribution
It offers new formulas and estimates for the covering number of wreath products of nonabelian finite simple groups with cyclic groups.
Findings
Derived formulas for (S \u2297 C_m) for specific simple groups S.
Provided bounds and estimates for the covering number (S \u2297 C_m).
Enhanced understanding of subgroup coverings in complex group structures.
Abstract
For a non-cyclic finite group let be the least number of proper subgroups of whose union is . Precise formulas or estimates are given for for certain nonabelian finite simple groups where is a cyclic group of order .
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
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
