Abstract M. C. Slattery [Generation of groups of square-free order, J. Symbolic Comput. 42 (2007), 6, 668–677] described computational methods to enumerate, construct and identify finite groups of squarefree order. We generalise Slattery’s result to the class of finite groups that have cyclic Sylow subgroups and provide an implementation for the computer algebra system GAP.

中文翻译：

---

用循环 Sylow 子群生成有限群

摘要 M. C. Slattery [无平方阶群的生成，J. Symbolic Comput。42 (2007), 6, 668–677] 描述了枚举、构造和识别无平方阶的有限群的计算方法。我们将 Slattery 的结果推广到具有循环 Sylow 子群的有限群类，并为计算机代数系统 GAP 提供了实现。