Generation of groups of square-free order.

DOI10.1016/J.JSC.2007.01.006MaRDI QIDQ2455751zbMATH OpenOpenAlexFDO

Authors 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

algorithmsfinite group databasesgroups of square-free ordernumbers of groupspower-conjugate presentations

Mathematics Subject Classification ID

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

Review text

Algorithms to deal fast and comprehensively with groups of square-free order are presented, aiming to support the following operations: count, list, build and identify. The presentation is nicely illustrated by examples and the timings are discussed: the time depends heavily on the chosen power-conjugate presentation (the shortest and the longest time differ by a factor of 100 for a sample of twenty randomly chosen presentations of the same group).

Recommendations

• scientific article; zbMATH DE number 6963520
• On groups of squarefree order
• On The Number of Groups of Squarefree Order
• Finite groups with square-free element orders
• Finite groups with subgroup core factor orders free of squares.
• Generation of finite groups by nilpotent subgroups.
• On the groups of cube-free order.
• scientific article; zbMATH DE number 1560264
• On Elusive Permutation Groups of Square-Free Degree
• Generating groups by conjugation-invariant sets.

Cites work

• Construction of finite groups
• Endliche Gruppen I
• scientific article; zbMATH DE number 4129096 (Why is no real title available?)
• scientific article; zbMATH DE number 1187240 (Why is no real title available?)
• On the groups of cube-free order.
• On Transitive Permutation Groups
• The groups of order at most 2000
• The Magma algebra system. I: The user language

Cited in

(6)

• Groups whose orders factorise into at most four primes
• Generation of finite groups with cyclic Sylow subgroups
• On the groups of cube-free order.
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Constructing groups of `small' order: recent results and open problems
• scientific article; zbMATH DE number 6963520 (Why is no real title available?)

Describes a project that uses

Uses Software

• GAP
• Magma
• Cubefree

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

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