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

有限单群的非交换、非生成图

The non-commuting, non-generating graph of a finite simple group

School of Mathematics and Statistics, University of St Andrews(圣安德鲁斯大学数学与统计学院);School of Mathematics, Monash University(蒙纳士大学数学院)

Saul D. Freedman

AI总结:

研究有限单群的非交换、非生成图的连通性和直径上界,证明其补图直径上限为4。

摘要:

设G是一个群,使得G/Z(G)是有限单群。非交换、非生成图Ξ(G)的顶点集为G \ Z(G),边对应于不交换且不生成G的元素对。在我们之前对非单群研究的基础上,我们证明了Ξ(G)是连通的,直径不超过5,对于某些群族有更小的上界。利用这些上界,我们进一步证明当G是单群时,G的生成图的补图的直径有一个紧致的上界为4,除了最多一个直径为5的群外。

英文摘要:

Let $G$ be a group such that $G/Z(G)$ is finite and simple. The non-commuting, non-generating graph $Ξ(G)$ of $G$ has vertex set $G \setminus Z(G)$, with edges corresponding to pairs of elements that do not commute and do not generate $G$. Complementing our previous investigation of this graph for non-simple groups, we show that $Ξ(G)$ is connected with diameter at most $5$, with smaller upper bounds for certain families of groups. Using these bounds, we then prove that when $G$ is simple, the diameter of the complement of the generating graph of $G$ has a tight upper bound of $4$, with the exception of at most one group with a graph of diameter $5$.

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

↑