arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.01482math.GRmath.CO
收藏

用Gruenberg-Kegel图判定有限群不可识别性

Criterion of unrecognizability of a finite group by its Gruenberg-Kegel graph

Peter J. Cameron, Natalia V. Maslova

摘要:

与有限群$G$相关联的Gruenberg-Kegel图$Γ(G)$的顶点是$|G|$的素因子,其边从$p$到$q$当且仅当$G$包含一个$pq$阶元素。这个图最近引起了人们的极大兴趣,我们的目标之一就是对其中的一些材料进行一个综述,这些材料与具有相同Gruenberg-Kegel图的群有关。然而,我们的主要目的是证明几个新的结果。其中包括:- 存在无穷多个有限群与一个有限群$G$的Gruenberg-Kegel图相同当且仅当存在一个具有非平凡可解根的有限群$H$使得$Γ(G)=Γ(H)$ . - 自然数上存在一个函数$F$,它具有如下性质:如果一个顶点由两两相异素数标号的有限$n$ -顶点图是多于$F(n)$有限群的Gruenberg-Kegel图,则它是无限多个有限群的Gruenberg-Kegel图. (The我们给出的函数满足$F(n)=O(n^7)$,但这可能不是最好的。)- 如果一个顶点为两两相异素数的有限图PDMATHAMBMY是仅有1/2个有限群的Gruenberg-Kegel图,则所有这样的群几乎是单的;而且,PDMATHAMBMY至少有3个两两不相邻的顶点,PDMATHAMBMZ至少与一个奇顶点不相邻. - 幂图或交换图同构的群具有相同的Gruenberg-Kegel图。- 群${^2}G_2(27)$和$E_8(2)$由它们的Gruenberg-Kegel图的同构类型唯一确定.此外,我们考虑群的Gruenberg-Kegel图没有边。这些都是团体中的每一个元素有素数权力秩序,并已研究下的名称\emph{EPPO groups} ;完成这条线的研究,我们给一个完整的名单,这样的群体。

英文摘要:

The Gruenberg-Kegel graph $Γ(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much recent interest; one of our goals here is to give a survey of some of this material, relating to groups with the same Gruenberg-Kegel graph. However, our main aim is to prove several new results. Among them are the following. - There are infinitely many finite groups with the same Gruenberg-Kegel graph as the Gruenberg-Kegel of a finite group $G$ if and only if there is a finite group $H$ with non-trivial solvable radical such that $Γ(G)=Γ(H)$. - There is a function $F$ on the natural numbers with the property that if a finite $n$-vertex graph whose vertices are labelled by pairwise distinct primes is the Gruenberg-Kegel graph of more than $F(n)$ finite groups, then it is the Gruenberg-Kegel graph of infinitely many finite groups. (The function we give satisfies $F(n)=O(n^7)$, but this is probably not best possible.) - If a finite graph $Γ$ whose vertices are labelled by pairwise distinct primes is the Gruenberg-Kegel graph of only finitely many finite groups, then all such groups are almost simple; moreover, $Γ$ has at least three pairwise non-adjacent vertices, and $2$ is non-adjacent to at least one odd vertex. - Groups whose power graphs, or commuting graphs, are isomorphic have the same Gruenberg-Kegel graph. - The groups ${^2}G_2(27)$ and $E_8(2)$ are uniquely determined by the isomorphism types of their Gruenberg-Kegel graphs. In addition, we consider groups whose Gruenberg-Kegel graph has no edges. These are the groups in which every element has prime power order, and have been studied under the name \emph{EPPO groups}; completing this line of research, we give a complete list of such groups.

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

↑