Covering monolithic groups with proper subgroups
Martino Garonzi

TL;DR
This paper investigates the minimal number of proper subgroups needed to cover a finite non-cyclic group and explores a conjecture linking subgroup coverings to the group's monolithic structure.
Contribution
It proposes a method to approach Lucchini and Detomi's conjecture by directly studying monolithic groups and their properties.
Findings
The paper clarifies the relationship between subgroup coverings and monolithic groups.
It suggests a new approach to prove the conjecture using properties of monolithic groups.
Abstract
Given a finite non-cyclic group , call the smallest number of proper subgroups of needed to cover . Lucchini and Detomi conjectured that if a nonabelian group is such that for every non-trivial normal subgroup of then is \textit{monolithic}, meaning that it admits a unique minimal normal subgroup. In this paper we show how this conjecture can be attacked by the direct study of monolithic groups.
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 · graph theory and CDMA systems · Coding theory and cryptography
