Generation of groups of square-free order. (Q2455751): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Revision as of 06:43, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generation of groups of square-free order. |
scientific article |
Statements
Generation of groups of square-free order. (English)
0 references
26 October 2007
0 references
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).
0 references
finite group databases
0 references
groups of square-free order
0 references
algorithms
0 references
numbers of groups
0 references
power-conjugate presentations
0 references
