arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.01262math.GR
收藏

基于子群数量的群可解性

Solvability of a group based on its number of subgroups

Presidency University(普雷西登西大学)

Angsuman Das, Arnab Mandal

AI总结:

本文基于群G的子群数量Sub(G),研究有限群的(super)-可解性和nilpotency条件,扩展了Betz和Nash关于子群数量少于20的有限群分类,并应用于研究共maximal子群图。

摘要:

本文提供了有限群G的(super)-可解性和nilpotency的一些条件,基于其子群数量Sub(G)。我们的结果扩展了Betz和Nash关于子群数量少于20的有限群分类。我们还利用这些结果研究了群的共maximal子群图。最后,我们总结了一些开放性问题。

英文摘要:

In this paper, we provide some conditions of (super)-solvability and nilpotency of a finite group $G$ based on its number of subgroups $Sub(G)$. Our results generalize the classification of finite groups with less than $20$ subgroups by Betz and Nash. We also provide an application of our results in studying comaximal subgroup graph of a group. Finally, we conclude with some open issues.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑