When is the search of relatively maximal subgroups reduced to quotients?
Wenbin Guo, Danila O. Revin

TL;DR
This paper investigates conditions under which the problem of classifying maximal subgroups in finite groups can be simplified by analyzing quotients, focusing on homomorphisms that preserve the number of conjugacy classes of such subgroups.
Contribution
It characterizes homomorphisms that preserve the number of conjugacy classes of maximal subgroups and relates this to the composition factors of their kernels.
Findings
Homomorphisms with kernels in a specific list preserve the number of conjugacy classes.
The equality of the number of maximal subgroups in a group and its image holds iff the kernel's composition factors are from a known list.
The paper provides a complete description of homomorphisms that maintain the maximal subgroup structure.
Abstract
Let be a class of finite groups closed under taking subgroups, homomorphic images, and extensions. Denote by the number of conjugacy classes -maximal subgroups of a finite group . The natural problem to describe up to conjugacy -maximal subgroups of a given finite group is complicated by the fact that it is not inductive. In particular, generally speaking, the image of an -maximal subgroup is not -maximal in the image of a homomorphism. Nevertheless, there are group homomorphisms which preserve the number of conjugacy classes of -maximal subgroups (for example, the homomorphisms whose kernels are -groups). Under such homomorphisms, the image of an -maximal subgroup is always -maximal and, moreover, there is a…
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 · Limits and Structures in Graph Theory
