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

有限单群谱生成算法的时间复杂度

The time complexity of some algorithms for generating the spectra of finite simple groups

Alexander Buturlakin

摘要:

谱$ω(G)$是$G$的元素的阶的集合。考虑有限非交换单群$G$的谱的生成问题,如果$G$是交错群,则由$G$的度给出;如果$G$是Lie型群,则由Lie型、Lie秩和基域的阶给出.

英文摘要:

The spectrum $ω(G)$ is the set of orders of elements of $G$. We consider the problem of generating the spectrum of a finite nonabelian simple group $G$ given by the degree of $G$ if $G$ is an alternating group, or the Lie type, Lie rank and order of the underlying field if $G$ is a group of Lie type.

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

↑