Generation of finite groups with cyclic Sylow subgroups

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.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…