Generation of finite groups with cyclic Sylow subgroups
From MaRDI portal
Publication:2218673
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.
Recommendations
Cites work
- 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?)
- A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
- Computing in general Abelian groups is hard
- Generation of groups of square-free order.
- On complexity of multiplication in finite soluble groups.
- On groups of squarefree order
- The Magma algebra system. I: The user language
Cited in
(4)
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)