Generation of finite groups with cyclic Sylow subgroups (Q2218673)

A finite group is squarefree if its order is not divisible by any prime-square. A finite group is called a C-group if it has cyclic Sylow subgroups. Clearly, a group of squarefree order is a C-group. \textit{O. Hölder} classified and enumerated the class of groups of square-free order in [Nachr. Ges. Wiss. Göttingen, Math.-Phys. Kl. 1895, 211--229 (1895; JFM 26.0162.01)]. More than 100 years later, \textit{M. C. Slattery} devised powerful algorithms for constructing and identifying groups of squarefree order in [J. Symb. Comput. 42, No. 6, 668--677 (2007; Zbl 1138.20001)]. In this paper, the authors generalise Slattery's result to the class of C-groups and provide an implementation for the computer algebra system GAP. For a positive integer \(n\), denote by \(C(n)\) the number of (isomorphism types) of C-groups of order \(n\). The main result in this paper is the following algorithms: \begin{itemize} \item[(A)] Construct a sorted list \(\mathcal{C}_n\) of all (isomorphism types of) C-groups of order \( n\). \item[(B)] For \(i\in \{1, 2, \dots, C(n)\}\), construct the \(i\)-th group in \(\mathcal{C}_n\) without creating the whole list. \item[(C)] For a C-group of order \(n\), determine its position \(i\) in \(\mathcal{C}_n\) without creating the whole list. \end{itemize}