Maximal covers of finite groups
Igor Lima, Raimundo Bastos, Jos\'e R. Rog\'erio

TL;DR
This paper investigates the maximum number of subgroups in irredundant coverings of finite groups, establishing conditions under which such groups are supersolvable or solvable, and describing the structure of groups with specific maximum counts.
Contribution
It proves that groups with at most 6 subgroups in an irredundant covering are supersolvable and characterizes groups with exactly 6, also showing groups with up to 30 are solvable.
Findings
Groups with λ(G) ≤ 6 are supersolvable.
Structural description of groups with λ(G) = 6.
Groups with λ(G) ≤ 30 are solvable.
Abstract
Let be the maximum number of subgroups in an irredundant covering of the finite group . We prove that if is a group with , then is supersolvable. We also describe the structure of the groups with . Moreover, we show that if is a group with , then is solvable.
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.
