Generation of finite groups with cyclic Sylow subgroups

DOI10.1515/JGTH-2020-0061MaRDI QIDQ2218673zbMATH OpenOpenAlexFDO

Authors Heiko Dietrich, Darren Low

Publication date 15 January 2021

Published in Journal of Group Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2005.02569

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05)

Abstract: Slattery (2007) 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.

Review text

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}

Recommendations

• Generation of groups of square-free order.
• The \(p\)-group generation algorithm
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Addendum to: ``Finite groups with a prescribed number of cyclic subgroups
• Computing in permutation and matrix groups. III: Sylow subgroups

Cites work

• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Computing in general Abelian groups is hard
• Generation of groups of square-free order.
• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 2133330 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• On complexity of multiplication in finite soluble groups.
• On groups of squarefree order
• The Magma algebra system. I: The user language

Cited in

(4)

• Groups whose orders factorise into at most four primes
• On the groups of cube-free order.
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• cgroups

Describes a project that uses

Uses Software

• Magma
• GAP
• SmallGroups Library
• GitHub

This page was built for publication: Generation of finite groups with cyclic Sylow subgroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218673)