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.

中文翻译：

---

订单最多分解为四个素数的组

在各种论文中已经描述了其阶分解为最多四个素数的组（直至同构）。给定这样一个阶数n，本文展示了一个新的显式且紧凑的确定n阶组的同构类型的方法，以及枚举，构造和识别这些组的有效算法。该算法是针对计算机代数系统GAP实现的。