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

具有算术小合成因子群的素图

The Prime Graphs of Groups With Arithmetically Small Composition Factors

Timothy J. Edwards, Thomas Michael Keller, Ryan M. Pesak, Karthik Sellakumaran Latha

摘要:

我们继续研究有限群的素图,也称为Gruenberg-Kegel图。有限群的素图的顶点是群阶的素除子,两个顶点$p$和$q$由一条边连通当且仅当群中存在一个$pq$阶元.可解群的素图仅在图论术语中被刻画,就像唯一不可解合成因子是$A_5$的群的素图一样。本文对所有合成因子具有算术小阶数的群的素图进行了分类,即群的阶数中的素除子不超过3个。我们发现,所有这样的图有$3$ -可着色补充,我们提供了充分的刻画的基础上的确切类型和多重性的nonabelian合成因子的群的素图。

英文摘要:

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in the group. Prime graphs of solvable groups have been characterized in graph theoretical terms only, as have been the prime graphs of groups whose only nonsolvable composition factor is $A_5$. In this paper we classify the prime graphs of all groups whose composition factors have arithmetically small orders, that is, have no more than three prime divisors in their orders. We find that all such graphs have $3$-colorable complements, and we provide full characterizations of the prime graphs of such groups based on the exact type and multiplicity of the nonabelian composition factors of the group.

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

↑