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

$\operatorname{PSL}_2(q)$中的最大聚集体

Maximal Cocliques in $\operatorname{PSL}_2(q)$

Jack Saunders

摘要:

有限群的生成图是一种结构,它可以用来编码群的某些信息。它由Liebeck和Shalev介绍,并由Lucchini,Maróti,Roney-Dougal和其他人进一步研究。我们研究了$q$为素数幂的$\operatorname{PSL}_2(q)$中的最大凝聚点(生成图的全不连通的诱导子图),并给出了当$q$为素数时的“大”凝聚点的分类。然后,我们提供了一个有趣的几何例子,这与此结果相矛盾时,$q$不是素数,并说明为什么用于素数的情况下使用的方法不立即扩展到素数幂的情况下,具有相同的结果。

英文摘要:

The generating graph of a finite group is a structure which can be used to encode certain information about the group. It was introduced by Liebeck and Shalev and has been further investigated by Lucchini, Maróti, Roney-Dougal and others. We investigate maximal cocliques (totally disconnected induced subgraphs of the generating graph) in $\operatorname{PSL}_2(q)$ for $q$ a prime power and provide a classification of the `large' cocliques when $q$ is prime. We then provide an interesting geometric example which contradicts this result when $q$ is not prime and illustrate why the methods used for the prime case do not immediately extend to the prime-power case with the same result.

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

↑