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

生成可迁置换群所需最小元素数的精确上界

Sharp upper bounds on the minimal number of elements required to generate a transitive permutation group

Gareth Tracey

摘要:

证明了若$G$是次数为$n\geq 2$的传递置换群,则$G$可由$\lfloor cn/\sqrt{\log{n}}\rfloor$元生成,其中$c:=\sqrt{3}/2$ .由于次数为$8$的传递群$D_8\circ D_8$,这个上界是最可能的。我们的新结果改进了作者2018年的一篇论文,并利用了最近对度为$48$的传递群的分类。

英文摘要:

The purpose of this paper is to prove that if $G$ is a transitive permutation group of degree $n\geq 2$, then $G$ can be generated by $\lfloor cn/\sqrt{\log{n}}\rfloor$ elements, where $c:=\sqrt{3}/2$. Owing to the transitive group $D_8\circ D_8$ of degree $8$, this upper bound is best possible. Our new result improves a 2018 paper by the author, and makes use of the recent classification of transitive groups of degree $48$.

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

↑