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

48次传递群及其应用

The transitive groups of degree 48 and some applications

Derek Holt, Gordon Royle, Gareth Tracey

摘要:

本文的主要目的是报告在岩浆的成功枚举的代表$195\,826\,352$共轭类的传递子群的对称群$S_{48}$度48。此外,我们已经确定,25707这些群体是最小的传递,其中713是难以捉摸的。最小传递的例子已经被用来枚举度为$48$的点传递图,其中有$1\,538\,868\,366$,除了$0.1625\%$之外,所有的都是Cayley图。我们还发现,最大数量的元素所需的任何这些群体是10,我们已经使用这一事实,以改善以前的一般界限的第三作者的数量所需的元素,以产生一个任意的传递置换群的一个给定的程度。这个改进的界限的证明细节将由第三作者作为单独的论文发表

英文摘要:

The primary purpose of this paper is to report on the successful enumeration in Magma of representatives of the $195\,826\,352$ conjugacy classes of transitive subgroups of the symmetric group $S_{48}$ of degree 48. In addition, we have determined that 25707 of these groups are minimal transitive and that 713 of them are elusive. The minimal transitive examples have been used to enumerate the vertex-transitive graphs of degree $48$, of which there are $1\,538\,868\,366$, all but $0.1625\%$ of which arise as Cayley graphs. We have also found that the largest number of elements required to generate any of these groups is 10, and we have used this fact to improve previous general bounds of the third author on the number of elements required to generate an arbitrary transitive permutation group of a given degree. The details of the proof of this improved bound will be published by the third author as a separate paper

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

↑