Maximal irredundant families of minimal size in the alternating group
Martino Garonzi, Andrea Lucchini

TL;DR
This paper determines the minimal size of maximal irredundant families of maximal subgroups in the alternating group on n letters, providing new insights into subgroup intersection properties in finite groups.
Contribution
It explicitly computes the value of Mindim(G) for the alternating group, advancing understanding of subgroup structures in finite simple groups.
Findings
Computed Mindim(G) for all alternating groups on n letters.
Established the structure of maximal irredundant families in these groups.
Provided formulas or bounds for the minimal size in specific cases.
Abstract
Let be a finite group. A family of maximal subgroups of is called `irredundant' if its intersection is not equal to the intersection of any proper subfamily. is called `maximal irredundant' if is irredundant and it is not properly contained in any other irredundant family. We denote by the minimal size of a maximal irredundant family of . In this paper we compute when is the alternating group on letters.
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.
