论文标题
将命令分解为最多四个素数的小组
Groups whose orders factorise into at most four primes
论文作者
论文摘要
在各种论文中，已经描述了将最多四个素数分解为四个素数的小组。鉴于这样的顺序n，本文表现出对N阶N组的同构类型的新明确和紧凑的确定，以及有效的算法，以枚举，构建和识别这些组。该算法是针对计算机代数系统差距实现的。
The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups of order n together with effective algorithms to enumerate, construct, and identify these groups. The algorithms are implemented for the computer algebra system GAP.
