Generation of groups of square-free order.

DOI10.1016/j.jsc.2007.01.006zbMath1138.20001OpenAlexW2051934329MaRDI QIDQ2455751

Michael C. Slattery

Publication date: 26 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2007.01.006

zbMATH Keywords

algorithmsnumbers of groupsgroups of square-free orderfinite group databasespower-conjugate presentations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (3)

Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Generation of finite groups with cyclic Sylow subgroups ⋮ Groups whose orders factorise into at most four primes

Uses Software

• GAP
• Magma
• Cubefree

Cites Work

• Construction of finite groups
• The Magma algebra system. I: The user language
• On the groups of cube-free order.
• The groups of order at most 2000
• On Transitive Permutation Groups
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item

This page was built for publication: Generation of groups of square-free order.